Holes in graphs

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-18

  Peng, Yuejian ^a   Rödl, Vojtech ^a   Ruciński, Andrzej Rucinski ^b  

^a EMORY UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043134369     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. N. Alon, M. Capalbo, Y. Kohayakawa, V. Rödl, A. Ruciński, E. Szemerédi, Universality and tolerance, In Proceedings of the 41st IEEE Annual Symposium on FOCS (2000), 14-21.
2. N. Alon, M. Capalbo, Y. Kohayakawa, V. Rödl, A. Ruciński, E. Szemerédi, Near-optimum universal graphs for graphs with bounded degrees, APPROX-RANDOM 2001, LNCS 3139 (2001) 170-180
3. P. Erdös, A. Gyarfas, and L. Pyber, Vertex coverings by monochromatic cycles and trees, J. Combin. Theory Ser. B 51 (1991), 90-95.
4. W. T. Gowers, Lower bounds of tower type for Szemerédi's uniformity lemma, GAFA, Geom. Funct. Anal. 7 (1997), 322-337.
5. R. L. Graham, V. Rödl and A. Ruciński, On bipartite graphs with linear Ramsey numbers, Combinatorica, 21 (2001), 199-209.
6. P. E. Haxell, Partitioning complete bipartite graphs by monochromatic cycles, Journal of Combinatorial Theory, Series B 69, (1997), 210-218.
7. S. Janson, T. LŁuczak, A. Ruciński, Random Graphs, John Wiley and Sons, New York, 2000.
8. J. Komlós, M.Simonovits, Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, Paul Erdos is Eighty (Volume 2), Keszthely (Hungary), 1993, Budapest (1996), 295-352.
9. E. Szemerédi, Regular partitions of graphs in Problèmes combinatoires et theorie des graphes, Orsay 1976, J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau, eds., Colloq. Internat. CNRS 260, Paris, 1978, 399-401.