Partial steiner systems and matchings in hypergraphs

Random Structures and Algorithms

Volumn 13, Issue 3-4, 1998, Pages 335-347

  Kostochka, A V ^a   Rodl V ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b EMORY UNIVERSITY   (United States)

Author keywords

Hypergraph matchings; Steiner systems

Indexed keywords

EID: 0032221887     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199810/12)13:3/4<335::aid-rsa8>3.0.co;2-w     Document Type: Article

References (22)

1. N. Alon, J.-H. Kim, and J. H. Spencer, Nearly perfect matchings in regular simple hypergraphs, Israel J. Math., 100, 171-187 (1997).
2. P. Erdos and H. Hanani, On a limit theorem in combinatorial analysis, Publ. Math. Debrecen, 10, 10-13 (1963).
3. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, A. Hajnal, R. Rado, and V. T. Sos, Eds., North-Holland, Amsterdam, 1975, pp. 609-628.
4. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, Eur. J. Combin., 6, 317-326 (1985).
5. D. Gordon, G. Kuperberg, O. Patashnik, and J. H. Spencer, Asymptotically optimal covering designs, J. Combin. Theory Ser. A, 75, 270-280 (1996).
6. D. A. Grable, More-than-nearly-perfect packings and partial designs, Combinatorica, to appear.
7. D. A. Grable, Nearly-perfect hypergraph packing is in NC, Inform. Process Lett., 60, 295-299 (1996).
8. H. Iwaniec and J. Pintz, Primes in short intervals, Monatsh. Math., 98, 115-143 (1984).
9. J. Kahn, Recent results on some not-so-recent hypergraph matching and covering problems, Bolyai Soc. Math. Stud., 3, 305-353 (1994).
10. J. Kahn, Coloring nearly-disjoint hypergraphs with n + o(n) colors, J. Combin. Theory Ser. A, 59, 31-39 (1992).
11. J. Kahn, A Linear programming perspective on the Frankl-Rödl-Pippenger theorem, Random Struct. Alg., 8, 149-157 (1996).
12. J. Kahn, Asymptotically good list-colorings, J. Combin. Theory Ser. A, 73, 1-59 (1996).
13. 2/\og t, Random Struct. Alg., 7, 173-208 (1995).
14. J.-H. Kim, manuscript.
15. N. N. Kuzjurin, On the difference between asymptotically good packings and coverings, Eur. J. Combin., 16, 35-40 (1995).
16. N. N. Kuzjurin, Almost optimal explicit constructions of asymptotically good packings and coverings, in Methods of Combinatorial Optimization, Moscow, Computer Center, 1997, pp. 12-29 (in Russian).
17. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1993.
18. M. Molloy and B. Reed, Asymptotically better list colourings, preprint, 1997.
19. N. Pippenger and J. H. Spencer, Asymptotic behavior of the chromatic index for hypergraphs, J. Combin. Theory Ser. A, 51, 24-42 (1989).
20. V. Rödl, On a packing and covering problem, Eur. J. Combin., 5, 69-78 (1985).
21. V. Rödl and L. Thoma, Asymptotic packing and the random greedy algorithm, Random Struct. Alg., 8, 161-177 (1996).
22. J. H. Spencer, Asymptotic packing via a branching process, Random Struct. Alg., 7, 167-172 (1995).