Tiling Turán theorems

Combinatorica

Volumn 20, Issue 2, 2000, Pages 203-218

  Komlós, János ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034360730     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070020     Document Type: Article

References (23)

1. SARMAD ABBASI: The solution of the El-Zahar problem, Ph. D. Thesis, Rutgers University, 1998.
2. N. ALON and E. FISCHER: 2-factors in dense graphs, Discrete Math., to appear.
3. N. ALON and R. YUSTER: Almost H-factors in dense graphs, Graphs and Combinatorics, 8 (1992), 95,-102.
4. N. ALON and R. YUSTER: H-factors in dense graphs, J. Combinatorial Theory Ser. B, 66 (1996), 269-282.
5. B. BOLLOBÁS: Extremal Graph Theory, Academic Press, New York 1978.
6. B. BOLLOBÁS and S. E. ELDRIDGE: Problem in: Proc. Colloque Intern. CNRS (J.-C. Bermond et. al. eds.), 1978.
7. B. BOLLOBÁS and S. E. ELDRIDGE: Packings of graphs and applications to computational complexity, J. Combinatorial Theory Ser. B, 25 (1978), 105-124.
8. K. CORRÁDI and A. HAJNAL: On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar., 14 (1963), 423-439.
9. L. DANZER B. GRÜNBAUM and V. KLEE: Helly's theorem and its relatives, in: Convexity (V.L. Klee, ed.), AMS, Providence, R.I. 1963, 101-180.
10. G. A. DIRAC: Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 69-81.
11. M. H. EL-ZAHAR: On circuits in graphs, Discrete Math., 50 (1984), 227-230.
12. 3-factors and covering cycles in graphs of minimum degree n/3, Combinatorics, (A. Hajnal, L. Lovász and V. Sós eds.), Colloq. Math. Soc. J. Bolyai, vol. 52, Eger (Hungary) (1987), 213-220.
13. P. ERDÖS: Some recent combinatorial problems, Preprint, November 1990.
14. P. ERDÖS and M. SIMONOVITS: A limit theorem in graph theory, Studia Sci. Math. Hungar., 1 (1966), 51-57.
15. P. ERDÖS and A. H. STONE: On the structure of linear graphs, Bull. Amer. Math. Soc., 52 (1946), 1089-1091.
16. A. HAJNAL and E. SZEMERÉDI: Proof of a conjecture of Erdös, Combinatorial Theory and its Applications vol. II (P. Erdös, A. Rényi and V. T. Sós eds.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam (1970), 601-623.
17. J. KOMLÓS: The Blow-up Lemma (survey), Combinatorics, Probability and Computing, 8 (1999), 161-176.
18. J. KOMLÓS G. N. SAŔKÖZY and E. SZEMERÉDI: Blow-up Lemma, Combinatorica, 17 (1997), 109-123.
19. 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 (Volume 2) (D. Miklós, V. T. Sós and T. Szönyi eds.), Keszthely (Hungary) (1993), Budapest (1996), 295-352.
20. HENRYK MINC: Nonnegative Matrices, John Wiley & Sons, New York 1988.
21. N. SAUER and J. SPENCER: Edge disjoint placements of graphs, J. Combinatorial Theory Ser. B, 25 (1978), 295-302.
22. E. SZEMERÉDI Regular partitions of graphs, Proc. Colloques Internationaux CNRS No 260 - Problèmes Combinatoires et Théorie des Graphes (J.-C. Bermond, J.-C. Fournier M. Las Vergnas and D. Sotteau eds.), Orsay (1976), 399-401.
23. P. TURÁN: On an extremal problem in graph theory (in Hungarian), Matematikai és Fizikai Lapok, 48 (1941), 436-452.