Hypergraph Packing and Graph Embedding

Combinatorics Probability and Computing

Volumn 8, Issue 4, 1999, Pages 363-376

  Rodl V ^a   Rucinski A ^b   Taraz, A ^c  

^a EMORY UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442296121     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399003879     Document Type: Article

References (17)

1. Alon, N. (1994) Packing of partial designs. Graphs and Combinatorics 10 11-18.
2. Alon, N., Duke, R., Lefmann, H., Rödl, V. and Yuster, R. (1994) The algorithmic aspects of the regularity lemma. J. Algorithms 16 80-109.
3. Alon, N. and Spencer, J. H. (1991) The Probabilistic Method, Wiley.
4. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
5. Bollobás, B. (1985) Random Graphs, Academic Press.
6. Bollobás, B. and Eldridge, S. E. (1978) Packing of graphs and applications to computational complexity. J. Combin. Theory Ser. B 25 105-124.
7. Ganter, P., Pelikan, J. and Teirlinck, L. (1977) On small sprawling systems of equicardinal sets. Ars Combinatoria 4 133-142.
8. Hajnal, A. and Szemerédi, E. (1970) Proof of a conjecture of Erdos. In Combinatorial Theory and its Applications, Vol. II (P. Erdos, A. Rényi and V. T. Sós, eds), Vol. 4 of Colloq. Math. Soc. J. Bolyai, North-Holland, Amsterdam, pp. 601-623.
9. Komlós, J., Sárkozy, G. N. and Szemerédi, E. (1995) Proof of a packing conjecture of Bollobás. Combinatorics, Probability and Computing 4 241-255.
10. Komlós, J., Sárkozy, G. N. and Szemerédi, E. On the Pósa-Seymour conjecture. J. Graph Theory, to appear.
11. Komlós, J., Sárkozy, G. N. and Szemerédi, E. Proof of the Alon-Yuster conjecture. To appear.
12. Komlós, J., Sárkozy, G. N. and Szemerédi, E. (1997) The Blow-up Lemma. Combinatorica 17 109-123.
13. Komlós, J., Sárkozy, G. N. and Szemerédi, E. (1998) An algorithmic version of the Blow-up Lemma. Random Structures and Algorithms 12 297-312.
14. Rödl, V and Ruciński, A. (1999) Perfect matchings in ε-regular graphs and the Blow-up Lemma. Combinatorica 19 1-16.
15. Sauer, N. and Spencer, J. (1978) Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25 295-302.
16. Szemerédi, E. (1978) Regular partitions of graphs. In Problèmes Combin. et Théorie des Graphes, Proceedings, Orsay 1976, Colloq. Intern. C.N.R.S. 260 (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas and D. Sotteau, eds), pp. 399-401.
17. Teirlinck, L. (1977) On making two Steiner Triple Systems disjoint. J. Combin. Theory Ser. A 23 349-350.