Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size

Journal of Combinatorial Theory. Series A

Volumn 78, Issue 2, 1997, Pages 199-235

  Kahn, Jeff ^a   Kayll, P Mark ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF MONTANA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010753118     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1997.2761     Document Type: Article

References (48)

1. Ajtai M., Komlós J., Pintz J., Spencer J., Szemerédi E. Extremal uncrowded hypergraphs. J. Combin. Theory Ser. A. 32:1982;321-335.
2. Ajtai M., Komlós J., Szemerédi E. A dense infinite Sidon sequence. Europ. J. Combin. 2. 1981;1-11.
3. Alon N., Spencer J. The Probabilistic Method. 1992;Wiley, New York.
4. N. Alon, J.-H. Kim, J. Spencer, Nearly perfect matchings in regular simple hypergraphs, Israel J. Math.
5. van den Berg J., Steif J. E. Percolation and the hard-core lattice gas model. Stochastic Process. Appl. 49:1994;179-197.
6. Berge C. Graphs and Hypergraphs. 1973;North-Holland, Amsterdam.
7. Berge C. Hypergraphs: Combinatorics of Finite Sets. 1989;North-Holland, Amsterdam.
8. Bollobás B. Extremal Graph Theory. 1978;Academic Press, London.
9. Chvátal V. Linear Programming. 1983;W. H. Freeman and Company, New York.
10. Edmonds J. Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards (B). 69:1965;125-130.
11. Erdos P. On the combinatorial problems which I would most like to see solved. Combinatorica. 1:1981;25-42.
12. Erdos P., Hanani H. On a limit theorem in combinatorial analysis. Publ. Math. Debrecen. 10:1963;10-13.
13. Erdos P., Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions. Infinite and Finite Sets. Colloq. Math. Soc. J. Bolyai. 10:1975;North-Holland, Amsterdam.
14. Frankl P., Rödl V. Near perfect coverings in graphs and hypergraphs. Europ. J. Combin. 6:1985;317-326.
15. Füredi Z. Matchings and covers in hypergraphs. Graphs Combin. 4:1988;115-206.
16. D. A. Grable, 1995, More-than-nearly perfect packings and partial designs.
17. Heilmann O. J., Lieb E. H. Monomers and dimers. Phys. Rev. Letters. 24:1970;1412-1414.
18. Heilmann O. J., Lieb E. H. Theory of monomer-dimer systems. Commun. Math. Phys. 25:1972;190-232.
19. A. Johansson, 1996, An improved upper bound on the choice number for triangle free graphs.
20. Kahn J. Recent results on some not-so-recent hypergraph matching and covering problems. Extremal Problems for Finite Sets, Visegrád, 1991. Bolyai Soc. Math. Studies. 3:1994.
21. Kahn J. On a problem of Erdos and Lovász. II:nrOr. J. Amer. Math. Soc. 7:1994;125-143.
22. Kahn J. Asymptotically good list-colorings. J. Combin. Theory Ser. A. 73:1996;1-59.
23. Kahn J. A linear programming perspective on the Frankl-Rödl-Pippenger theorem. Random Struct. Alg. 8:1996;149-157.
24. Kahn J. Asymptotics of the chromatic index for multigraphs. J. Combin. Theory Ser. B. 68:1996;233-254.
25. J. Kahn, Asymptotics of the list-chromatic index for multigraphs.
26. J. Kahn, A normal law for matchings.
27. J. Kahn, P. M. Kayll, On the stochastic independence properties of hard-core distributions, Combinatorica.
28. P. M. Kayll, 1994, Asymptotically Good Covers in Hypergraphs, Rutgers University, New Brunswick, NJ.
29. P. M. Kayll, 1995, Asymptotically Good Covers in Hypergraphs: Extended Abstract of the Dissertation, DIMACS, Piscataway, NJ.
30. Kayll P. M. "Normal" distributions on matchings in a multigraph: overview with applications. Congr. Numer. 107:1995;179-191.
31. Kim J.-H. On Brooks' Theorem for sparse graphs. Combin. Probab. Comput. 4:1995;97-132.
32. 2t. Random Struct. Alg. 7:1995;173-207.
33. Komlós J., Pintz J., Szemerédi E. A lower bound for Heilbronn's problem. J. London Math. Soc. 25:1982;13-24.
34. Kunz H. Location of the zeros of the partition function for some classical lattice systems. Phys. Lett. 32A:1970;311-312.
35. Lee C. W. Some recent results on convex polytopes. Contemporary Mathematics. 1990;AMS.
36. C. W. Lee, 1994, Convex polytopes, the moment map, and canonical convex combinations.
37. G. M. Louth, 1990, Stochastic Networks: Complexity, Dependence and Routing, Cambridge University.
38. Lovász L., Plummer M. D. Matching Theory. 1986;North-Holland, New York.
39. N. Pippenger.
40. Pippenger N., Spencer J. Asymptotic behavior of the chromatic index for hypergraphs. J. Combin. Theory Ser. A. 51:1989;24-42.
41. Y. Rabinovich, A. Sinclair, A. Wigderson, 1992, Quadratic dynamical systems (preliminary version), Proc. 33rd IEEE Symposium on Foundations of Computer Science.
42. Rödl V. On a packing and covering problem. Europ. J. Combin. 6:1985;69-78.
43. Rödl V., Thoma L. Asymptotic packing and the random greedy algorithm. Random Struct. Alg. 8:1996;161-177.
44. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, New York.
45. Spencer J. Asymptotically good coverings. Pacific J. Math. 118:1985;575-586.
46. J. Spencer, 1987, The Rödl nibble, M.I.T.
47. Spencer J. Ten Lectures on the Probabilistic Method. 1993;SIAM, Philadelphia.
48. Spencer J. Asymptotic packing via a branching process. Random Struct. Alg. 7:1995;167-172.