A linear programming perspective on the Frankl-Rödl-Pippenger theorem

Random Structures and Algorithms

Volumn 8, Issue 2, 1996, Pages 149-157

  Kahn, Jeff ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040304639     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199603)8:2<149::AID-RSA5>3.3.CO;2-S     Document Type: Article

References (25)

1. M. Ajtai, J. Komlós, and E. Szemerédi, A dense infinite Sidon sequence, Eur. J. Combinat., 2, 1-11 (1981).
2. P. Erdos, On the combinatorial problems which I would most like to see solved, Combinatorica, 1, 25-42 (1981).
3. P. Erdos and H. Hanani, On a limit theorem in combinatorial analysis, Publ. Math. Debrecen, 10, 10-13 (1963).
4. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Coll. Math. Soc. J. Bolyai, 10, 609-627 (1974).
5. P. Frankl and V. Rodl, Near-perfect coverings in graphs and hypergraphs, Eur. J. Combinator., 6, 317-326 (1985).
6. Z. Füredi, Matchings and covers in hypergraphs, Graphs Combinat. 4, 115-206 (1988).
7. A. Johansson, An improved upper bound on the choice number for triangle free graphs, preprint, 1994.
8. J. Kahn, Coloring nearly-disjoint hypergraphs with n + o(n) colors, J. Combinat. Theor. (A), 59, 31-39 (1992).
9. J. Kahn, On a problem of Erdos and Lovász: random lines in a projective plane, Combinatorica, 12, 417-423 (1992).
10. J. Kahn, 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, pp. 305-353.
11. J. Kahn, On a problem of Erdos and Lovász II: n(r) = O(r), J. Am. Math. Soc. 7, 125-143 (1994).
12. J. Kahn, Asymptotically good list-colorings, J. Combinat. Theor. (A), to appear.
13. J. Kahn, On some hypergraph problems of Paul Erdos and the asymptotics of matchings, covers and colorings, in The Mathematics of Paul Erdos, to appear.
14. J. Kahn, Asymptotics of hypergraph matching, covering and coloring problems, Proc. ICM 94, to appear.
15. J. Kahn, Asymptotics of the chromatic index for multigraphs, submitted.
16. J. Kahn and P.M. Kayll, Fractional vs. integer covers in hypergraphs of bounded edge size, preprint, 1995.
17. 2/log t, Random Struct. Alg. 7, 173-207 (1995).
18. J. Komlós, J. Pintz, and E. Szemerédi, A lower bound for Heilbronn's problem, J. London Math. Soc., 25, 13-24 (1982).
19. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs, J. Combinat. Theory. (A), 51, 24-42 (1989).
20. V. Rödl, On a packing and covering problem, Eur. J. Combinat. 5, 69-78 (1985).
21. i/i! is asymptotically normal, Discrete Math., 49, 287-290 (1984).
22. J. Spencer, Lecture notes, Massachusetts Institute of Technology, Cambridge, MA, 1987.
23. J. Spencer, Asymptotic packing via a branching process, Random Struct. Alg. 7, 167-172 (1995).
24. J. Spencer, personal communication.
25. R. M. Wilson, Concerning the number of mutually orthogonal Latin squares, Discrete Math., 9, 181-198 (1974).