Proof of a Tiling Conjecture of Komlós

Random Structures and Algorithms

Volumn 23, Issue 2, 2003, Pages 180-205

  Shokoufandeh, Ali ^a   Zhao, Yi ^b  

^a Drexel University   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Blow up Lemma; Critical Chromatic Number; Regularity Lemma; Tiling

Indexed keywords

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

References (15)

1. S. Abbasi, The solution of the El-Zahar problem, Ph.D. Thesis, Rutgers University, New Brunswick, NJ, 1998.
2. N. Alon and R. Yuster, Almost h-factors in dense graphs. Graphs Combin 8 (1992), 95-107.
3. N. Alon and R. Yuster, h-factors in dense graphs, J Combin Theory Ser B B66 (1996), 269-282.
4. H. Corrádi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math Hungar 14 (1963), 423-439.
5. G. A. Dirac, Some theorem on abstract graphs, Proc London Math Soc 2 (1952), 69-81.
6. M. H. El-Zahar, On circuits in graphs, Discrete Math 50 (1984), 227-230.
7. A. Hajnal and E. Szemerédi, "Proof of a conjecture of Erdös," Combinatorial theory and its applications, II, P. Erdös and V. T. Sós, Eds., Colloquia Mathematica Societatis János Bolyai. North-Holland, Amsterdam/London, 601-623, 1970.
8. J. Komlós, Tiling Turán theorems, Combinatorica 20(2) (2000), 203-218.
9. J. Komlós, G. N. Sárközy, and E. Szemerédi, Blow-up lemma, Combinatorica 17 (1997), 109-123.
10. J. Komlós, G. N. Sárközy, and E. Szemerédi, An algorithmic version of blow-up lemma, Random Structures Algorithms 12 (1998), 297-312.
11. J. Komlós, G. N. Sárközy, and E. Szemerédi, Proof of the Alon-Yuster conjecture. Combinatorics (Prague, 1998). Discrete Math 235(1-3) (2001), 255-269.
12. J. Komlós, G. N. Sárközy, and E. Szemerédi, Proof of the Alon-Yuster conjecture. Combinatorics (Prague, 1998). Discrete Math 235(1-3) (2001), 255-269.
13. J. Komlós and M. Simonovits, "Szemerédi's Regularity Lemma and its applications in graph theory (survey)," Bolyai Society Mathematical Studies 2, Combinatorics, Paul Erdös is eighty, D. Miklós, V. T. Sós, and T. Szönyi Eds, Keszthely (Hungary) (1993), Vol. 2, 295-352. Budapest, János Bolyai Mathematics Society, 1996.
14. A. Shokoufandeh and Y. Zhao, On a Tiling conjecture of Komlós for 3-chromatic graphs, Discrete Math, under review.
15. E. Szemerédi, Regular partitions of graphs, Coll Int CNRS No. 260 Problèmes Combinatoires et Théorie des Graphes, 1976, pp. 399-401.