Spanning Trees in Dense Graphs

Combinatorics Probability and Computing

Volumn 10, Issue 5, 2001, Pages 397-416

  Komlós, János ^a   Sárközy, Gábor N ^b   Szemerédi, Endre ^a,c  

^a RUTGERS UNIVERSITY   (United States)

^b Worcester Polytechnic Institute   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442326405     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0963548301004849     Document Type: Article

References (16)

1. 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.
2. Bollobás, B. (1978) Extremal Graph Theory, Academic Press, London.
3. Bollobás, B. and Eldridge, S. E. (1978) Packings of graphs and applications to computational complexity. J. Combin. Theory Ser. B 25 105-124.
4. 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.
5. Kohayakawa, Y. (1997) Szemerédi's Regularity Lemma for sparse graphs. In Foundations of Computational Mathematics (F. Cucker and M. Schub, eds), Springer.
6. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1995) Proof of a packing conjecture of Bollobás. Combin. Probab. Comput. 4 241-255.
7. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1996) On the square of a Hamiltonian cycle in dense graphs. Random Struct. Alg. 9 193-211.
8. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1997) Blow-up Lemma. Combinatorica 17 109-123.
9. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1998) An algorithmic version of the Blow-up Lemma. Random Struct. Alg. 12 297-312.
10. Komlós, J., Sárközy, G. N. and Szemerédi, E. (1998) Proof of the Seymour conjecture for large graphs. Ann. Combin. 2 43-60.
11. Komlós, J., Sárközy, G. N. and Szemerédi, E. Proof of the Alon-Yuster conjecture. To appear.
12. Lovász, L. (1979) Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest.
13. Sauer, N. and Spencer, J. (1978) Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25 295-302.
14. Simonovits, M. and Sós, V. T. (1991) Szemerédi's partition and quasirandomness, Random Struct. Alg. 2 1-10.
15. Szemerédi, E. (1976) Regular partitions of graphs. Colloques Internationaux C.N.R.S. No 260: Problèmes Combinatoires et Théorie des Graphes, Orsay, pp. 399-401.
16. Szemerédi, E. (1975) On a set containing no k elements in arithmetic progression. Acta Arithmetica XXVII 199-245.