The Blow-up Lemma

Combinatorics Probability and Computing

Volumn 8, Issue 1-2, 1999, Pages 161-176

  Komlós, János ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442296136     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548398003502     Document Type: Article

References (31)

1. Aigner, M. and Brandt, S. (1993) Embedding arbitrary graphs of maximum degree 2. J. London Math. Soc. 48 39-51.
2. Ajtai, M., Komlós, J. and Szemerédi, E. (1992) On a conjecture of Loebl. In Graph Theory, Combinatorics, and Applications (Y. Alavi, and A. Schwenk, eds), Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs (on the occasion of Paul Erdos's 80th birthday), Kalamazoo, Michigan, pp. 1135-1146.
3. Alon, N., Duke, R., Leffman, H., Rödl, V. and Yuster, R. (1993/4) Algorithmic aspects of the regularity lemma, FOCS 33 (1993) 479-481, Journal of Algorithms 16 (1994) 80-109.
4. Alon, N., Duke, R., Leffman, H., Rödl, V. and Yuster, R. (1993/4) Algorithmic aspects of the regularity lemma, FOCS 33 (1993) 479-481, Journal of Algorithms 16 (1994) 80-109.
5. Alon, N. and Fischer, E. (1996) 2-factors in dense graphs. Discrete Math. 152 13-23.
6. Alon, N. and Yuster, R. (1992) Almost H-factors in dense graphs. Graphs and Combinatorics 8 95-102.
7. Alon, N. and Yuster, R. (1996) H-factors in dense graphs. J. Combin. Theory Ser. B 66 269-282.
8. Bollobás, B. (1978) Extremal Graph Theory, Academic Press, London.
9. Chvátal, V., Rödl, V., Szemerédi, E. and Trotter Jr., W. T. (1983) The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34 239-243.
10. Corrádi, K. and Hajnal, A. (1963) On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14 423-439.
11. Dirac, G. A. (1952) Some theorems on abstract graphs. Proc. London Math. Soc. 2 68-81.
12. Erdos, P., Füredi, Z., Loebl, M. and Sós, V. T. (1995) Discrepancy of trees. Studia Sci. Math. Hungar. 30 47-57.
13. Erdos, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hungar. 1 51-57.
14. Erdos, P. (1963) Extremal problems in graph theory. In Theory of Graphs and its Applications, Proceedings of the Symposium held in Smolenice in June 1963, pp. 29-38.
15. Erdos, P. and Stone, A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 1089-1091.
16. 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.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam, pp. 601-623.
17. 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.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam, pp. 601-623.
18. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1995) Proof of a packing conjecture of Bollobás. In AMS Conference on Discrete Mathematics, DeKalb, Illinois (1993). Combinatorics, Probability and Computing 4 241-255.
19. Komlós, J., Sárközy, G. N. and Szemerédi, E. On the Pósa-Seymour conjecture. Submitted to J. Graph Theory.
20. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1997) The Blow-up Lemma. Combinatorica 17 109-123.
21. Komlós, J., Sárközy, G. N. and Szemerédi, E. An algorithmic version of the Blow-up Lemma. To appear in Random Structures and Algorithms.
22. Komlós, J. and Simonovits, M. (1996) Szemerédi's Regularity Lemma and its applications in graph theory. In Combinatorics: Paul Erdos is Eighty, Vol. 2 (D. Miklós, V. T. Sós and T Szonyi, eds), Bolyai Society Math. Studies, Keszthely, Hungary, pp. 295-352.
23. Roth, K. F. (1954) On certain sets of integers (II). J. London Math. Soc. 29 20-26.
24. Ruzsa, I. Z. and Szemerédi, E. (1978) Triple systems with no six points carrying three triangles, In Combinatorics (Keszthely, 1976), 18 Vol. II., North-Holland, Amsterdam/New York, pp. 939-945.
25. Sauer, N. and Spencer, J. (1978) Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25 295-302.
26. Seymour, P. (1974) Problem section: combinatorics. In Proceedings of the British Combinatorial Conference 1973 (T. P. McDonough and V. C. Mavron, eds), Cambridge University Press, pp. 201-202.
27. Simonovits, M. (1996) Paul Erdos's influence on extremal graph theory. In The Mathematics of Paul Erdos (R. L. Graham and J. Nešetřil, eds), Springer, Berlin, pp. 148-192.
28. Simonovits, M. and Sós, V. T. (1991) Szemerédi's partition and quasirandomness. Random Structures and Algorithms 2 1-10.
29. Szemerédi, E. (1976) Regular partitions of graphs. In Colloques Internationaux C.N.R.S. No 260 - Problèmes Combinatoires et Théorie des Graphes, Orsay, pp. 399-401.
30. Turán, P. (1941) On an extremal problem in graph theory. Matematikai es Fizikai Lapok 48 436-452. In Hungarian.
31. El-Zahar, M. H. (1984) On circuits in graphs. Discrete Math. 50 227-230.