New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help

Random Structures and Algorithms

Volumn 17, Issue 1, 2000, Pages 29-63

  Vu, Van H ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034355272     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200008)17:1<29::AID-RSA4>3.0.CO;2-W     Document Type: Article

References (27)

1. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matching in regular simple hypergraphs, Israel J Math 100 (1997), 171-187.
2. N. Alon and J. Spencer, The probabilistic method, Wiley, New York, 1992.
3. P. Erdos and H. Hanani, On a limit theorem in combinatorial analysis, Publ Math Debrecen 10 (1963), 10-13.
4. P. Erdos and L. Lovász, "Problems and results on 3-chromatic hypergraphs and some related questions," Infinite and finite sets, A. Hajnal et al. (Editors), North-Holland, Amsterdam, pp. 609-628.
5. P. Frankl and V. Rödl, Near perfect covering in graphs and hypergraphs, Eur J Combin 6 (1985), 317-326.
6. D. Grable, More than nearly perfect packings in partial designs, Combinatorica, to appear.
7. D. Grable, Nearly perfect hypergraph packing in NC, Inform Process Lett. 60 (1996), 295-299.
8. D. Gordon, G. Kuperberg, O. Patashnik, and J. Spencer, Asymptotically optimal covering designs, J Combin Theory Ser A 75 (1996), 270-280.
9. J. Kahn, "One some hypergraph problems of P. Erdos and the asymptotics of matchings, covers and colorings," The mathematics of P. Erdos, R. Graham and J. Nesetril (Editors), Springer, Berlin, 1997.
10. J. Kahn, Asymptotically good list-colorings, J Combin Theory Ser. A 73 (1996), 1-59.
11. J. H. Kim, manuscript.
12. J. H. Kim and V. H. Vu, On the concentration of multivariate polynomials and applications, Combinatorica, to appear.
13. J. H. Kim and V. H. Vu, Small complete arcs in protective planes, submitted.
14. A. Kostochka and V. Rödl, Partial Steiner systems and matchings in hypergraphs, Random Struct Alg 13 (1997), 335-347.
15. N. Kuzjurin, On the difference between asymptotically good parkings and coverings, Eur J Combin 16 (1995), 35-40.
16. N. Kuzjurin, "Almost optimal explicit constructions of asymptotically good packings and coverings," Methods of combinatorial optimization (in Russian), Moscow, Computer Center, 1997, pp. 12-19.
17. N. Pippenger, unpublished.
18. N. Pippenger and J. Spencer, Asymptotic behaviour of the chromatic index of hypergraphs, J Combin Theory Ser A 51 (1989), 24-42.
19. V. Rödl, On a packing and covering problem, Eur J Combin 5 (1985), 69-78.
20. J. Spencer, Asymptotic packing via a branching process, Random Struct Alg 7 (1995), 167-172.
21. J. Spencer, The Erdos-Hanani conjecture via Talagrand's inequality, IMA preprint Series 1202, 1994.
22. M. Talagrand, Concentration of measures and isoperimetric inequalities in product spaces, Publ Math l'I.H.E.S. 81 (1996), 73-205.
23. V. H. Vu, Average smoothness: new concentration results and applications, manuscript.
24. V. H. Vu, On the list chromatic number of locally sparse graphs, manuscript.
25. V. H. Vu, On some degree conditions which guarantee the upper bound of chromatic (choice) number of random graphs, J Graph Theory 31 (1999), 201-226.
26. V. H. Vu, On a refinement of Waring's problem, Duke Math J, to appear.
27. V. H. Vu, On the concentration of multi-variate polynomials with small expectation, Random Struct Alg, to appear.