Integer and fractional packings of hypergraphs

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 2, 2007, Pages 245-268

  Rodl V ^a   Schacht, M ^b   Siggers, M H ^a   Tokushige, N ^c  

^a EMORY UNIVERSITY   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

^c UNIVERSITY OF THE RYUKYUS   (Japan)

Author keywords

Hypergraph regularity lemma; Packings

Indexed keywords

EID: 33846138016     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.05.006     Document Type: Article

References (21)

1. Alon N., Duke R.A., Lefmann H., Rödl V., and Yuster R. The algorithmic aspects of the regularity lemma. J. Algorithms 16 1 (1994) 80-109
2. S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, 29 May-1 June 1995, pp. 284-293
3. Czygrinow A., Poljak S., and Rödl V. Constructive quasi-Ramsey numbers and tournament ranking. SIAM J. Discrete Math. 12 1 (1999) 48-63 (electronic)
4. Dor D., and Tarsi M. Graph decomposition is NP-complete: A complete proof of Holyer's conjecture. SIAM J. Comput. 26 4 (1997) 1166-1187
5. Frankl P., and Rödl V. Near perfect coverings in graphs and hypergraphs. European J. Combin. 6 4 (1985) 317-326
6. Frankl P., and Rödl V. Extremal problems on set systems. Random Structures Algorithms 20 2 (2002) 131-164
7. Frieze A., and Kannan R. The regularity lemma and approximation schemes for dense problems. 37th Annual Symposium on Foundations of Computer Science (FOCS), Burlington, VT (1996), IEEE Computer Soc., Los Alamitos, CA 12-20
8. Frieze A., and Kannan R. Quick approximation to matrices and applications. Combinatorica 19 2 (1999) 175-220
9. Gowers W.T. Lower bounds of tower type for Szemerédi's uniformity lemma. Geom. Funct. Anal. 7 2 (1997) 322-337
10. W.T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, submitted for publication
11. Grable D.A. Nearly-perfect hypergraph packing is in NC. Inform. Process. Lett. 60 6 (1996) 295-299
12. Haxell P.E., and Rödl V. Integer and fractional packings in dense graphs. Combinatorica 21 1 (2001) 13-38
13. Haxell P.E., Nagle B., and Rödl V. Integer and fractional packings in dense 3-uniform hypergraphs. Random Structures Algorithms 22 3 (2003) 248-310
14. Haxell P.E., Nagle B., and Rödl V. An algorithmic version of the hypergraph regularity method. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 23-25 October 2005, Pittsburgh, PA (2005), IEEE Computer Soc. 439-448
15. Kohayakawa Y., Rödl V., and Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity. J. Combin. Theory Ser. A 97 2 (2002) 307-352
16. Komlós J., and Simonovits M. Szemerédi's regularity lemma and its applications in graph theory. Combinatorics, Paul Erdo{combining double acute accent}s is Eighty, vol. 2, Keszthely, 1993. Bolyai Soc. Math. Stud. vol. 2 (1996), János Bolyai Math. Soc., Budapest 295-352
17. Pippenger N., and Spencer J. Asymptotic behavior of the chromatic index for hypergraphs. J. Combin. Theory Ser. A 51 1 (1989) 24-42
18. V. Rödl, M. Schacht, Regular partitions of hypergraphs, Combin. Probab. Comput., in press
19. Rödl V., and Skokan J. Regularity lemma for k-uniform hypergraphs. Random Structures Algorithms 25 1 (2004) 1-42
20. Yuster R. Fractional decompositions of dense hypergraphs. In: Chekuri C., Jansen K., Rolim J.D.P., and Trevisan L. (Eds). Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques (APPROX-RANDOM). Berkeley, CA, USA, August 22-24, 2005. Lecture Notes in Comput. Sci. vol. 3624 (2005), Springer 482-493
21. Yuster R. Integer and fractional packing of families of graphs. Random Structures Algorithms 26 1-2 (2005) 110-118