Integer and Fractional Packings in Dense 3-Uniform Hypergraphs

Random Structures and Algorithms

Volumn 22, Issue 3, 2003, Pages 248-310

  Haxell, Penny ^a   Nagle, Brendan ^b   Rödl, Vojtěch ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c EMORY UNIVERSITY   (United States)

Author keywords

Integer and fractional packings; Regularity lemma for hypergraphs

Indexed keywords

EID: 0037278985     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10075     Document Type: Article

References (14)

1. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc ACM Symp Theory of Computing, Las Vegas, NV, 1995, pp. 284-293.
2. A. Czygrinow, S. Poljak, and V. Rödl, Constructive quasi-Ramsey numbers and tournament ranking, SIAM J Discrete Mathematics 12 (1999), 48-63.
3. D. Dor and M. Tarsi, Graph decomposition is NPC - a complete proof of Holyer's conjecture, Proc ACM Symp Theory of Computing, Victoria, BC, 1992, pp. 252-263.
4. R. Duke, H. Lefmann, and V. Rödl, A fast algorithm for computing frequencies in a given graph, SIAM J Comput 24 (1995), 598-620.
5. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, Eur J Combinat 6 (1985), 317-326.
6. P. Frankl and V. Rödl, Extremal problems on set systems, Random Struct Alg 20 (2002), 131-164.
7. A. Frieze and R. Kannan, The Regularity Lemma and approximation schemes for dense problems, Proc IEEE Symp Foundations of Computer Science, Burlington, VT, 1996, pp. 12-20.
8. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
9. P. Haxell and V. Rödl, Integer and fractional packings in dense graphs, Combinatorica 21 (2001), 13-38.
10. S. Janscn, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
11. J. Kahn, A linear programming perspective on the Frankl-Rödl-Pippenger Theorem, Random Struct Alg 8 (1996), 149-157.
12. B. Nagle, Regularity properties for triple systems, Ph.D. Thesis, Emory University, Atlanta, GA, 1999.
13. B. Nagle and V. Rödl, Regularity properties for triple systems, Random Struct Alg, to appear.
14. E. Szemerédi, "Regular partitions of graphs," Problèmes en combinatoire et théorie des Graphes, Proc Coll Int CNRS, J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, and D. Sotteau, 1978, pp. 399-401.