More-than-nearly-perfect packings and partial designs

Combinatorica

Volumn 19, Issue 2, 1999, Pages 221-239

  Grable, David A ^a  

^a Algorithmic Solutions Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039522021     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050053     Document Type: Article

References (11)

1. N. ALON, J. H. KIM, and J. H. SPENCER: Nearly perfect matchings in regular simple hypergraphs, Israel Journal of Mathematics 100 (1997), 171-188.
2. P. ERDÖS and H. HANANI: On a limit theorem in combinatorial analysis, Publ. Math. Debrecen 10 (1963), 10-13.
3. P. FRANKL and V. RÖDL: Near perfect coverings in graphs and hypergraphs, European Journal of Combinatorics 6 (1985), 317-326.
4. J. KAHN: Coloring nearly-disjoint hypergraphs with n + o(n) colors, J. Combin. Theory, Ser. A 59 (1992), 31-39.
5. J. KAHN: Asymptotically good list-colorings, J. Combin. Theory, Ser. A 73 (1996), 1-59.
6. N. N. KUZJURIN: On the difference between asymptotically good packings and coverings, European Journal of Combinatorics, 16 (1995), 35-40.
7. N. PIPPENGER and J. SPENCER: Asymptotic behavior of the chromatic index for hypergraphs, J. Combin. Theory, Ser. A 51 (1989), 24-42.
8. V. RÖDL: On a packing and covering problem, European Journal of Combinatorics 5 (1985), 69-78.
9. J. SPENCER: Applications of Talagrand's inequality, manuscript, March 1995.
10. M. TALAGRAND: Concentration of measure and isoperimetric inequalities in product spaces, Publ. Math. 81, 73-205.
11. R. M. WILSON: An existence theory for pairwise balanced designs, III: proof of the existence conjectures, J. Combin. Theory, Ser. A 18 (1975), 71-79.