Regular Pairs in Sparse Random Graphs I

Random Structures and Algorithms

Volumn 22, Issue 4, 2003, Pages 359-434

  Kohayakawa, Y ^a   Rodl V ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b EMORY UNIVERSITY   (United States)

Author keywords

Random graphs; Regular pairs; Szemer di's regularity lemma

Indexed keywords

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

References (48)

1. N. Alon, M. R. Capalbo, Y. Kohayakawa, V. Rödl, A. Ruciński, and E. Szemerédi, Universality and tolerance (extended abstract), Proc 41st IEEE Annu Symp Foundations of Computer Science (FOCS 2000), 2000, pp. 14-21.
2. N. Alon and F. R. K. Chung, Explicit construction of linear sized tolerant networks, Discrete Math 72(1-3) (1988), 15-19, MR 90f:05080.
3. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the regularity lemma (extended abstract), 33rd Annu Symp Foundations of Computer Science, Pittsburgh, IEEE Comput Soc Press, New York, 1992, pp. 473-481.
4. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the regularity lemma, J Alg 16(1) (1994), 80-109, MR 94j:05112.
5. L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity theory (preliminary version), 27th Annu Symp Foundations of Computer Science, Toronto, IEEE, New York 1986, pp. 337-347.
6. J. Beck, On size Ramsey number of paths, trees, and circuits I, Journal of Graph Theory 7(1) (1983), 115-129, MR 84g:05102.
7. J. Beck, On size Ramsey number of paths, trees, and circuits II, Mathematics of Ramsey theory, Algorithms and Combinatorics, Vol. 5, Springer-Verlag, Berlin, 1990, pp. 34-45.
8. B. Bollobás, Random graphs, Academic, London, 1985, MR 87f:05152.
9. F. R. K. Chung, R. L. Graham, and R. M. Wilson, Quasi-random graphs, Combinatorica 9(4) (1989), 345-362, MR 91e:05074.
10. F. Chung and R. Graham, Sparse quasi-random graphs, Combinatorica 22(2) (2002), 217-244, Special Issue: Paul Erdõs and His Mathematics, MR 1 909 084.
11. R. A. Duke, H. Lefmann, and V. Rödl, A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J Comput 24(3) (1995), 598-620, MR 96e:05155.
12. P. Erdos, Some remarks on the theory of graphs, Bull Am Math Soc 53 (1947), 292-294, MR 8, 479d.
13. P. Erdos, On the combinatorial problems which I would most like to see solved, Combinatorica 1(1) (1981), 25-42, MR 82k:05001.
14. P. Erdos, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The size Ramsey number, Periodica Math Hung 9(2-2) (1978), 145-161, MR 80h:05037.
15. P. Erdos and J. Spencer, Probabilistic methods in combinatorics, Probability and Mathematical Statistics, Vol. 17, Academic, New York, London, 1974, MR 52 #2895.
16. 4, Graphs Combinat 2(2) (1986), 135-144, MR 89b:05124.
17. P. Frankl, V. Rödl, and R. M. Wilson, The number of submatrices of a given type in a Hadamard matrix and related results, J Combinat Theor Ser B 44(3) (1988), 317-328, MR 89f:05044.
18. E. Friedgut and M. Krivelevich, Sharp thresholds for certain Ramsey properties of random graphs, Random Struct Alg 17(1) (2000), 1-19, MR 2001i:05136.
19. J. Friedman and N. Pippenger, Expanding graphs contain all small trees, Combinatorica 7(1) (1987), 71-76, MR 88k:05063.
20. Z. Füredi, Random Ramsey graphs for the four-cycle, Discrete Math 126 (1994), 407-410, MR 94m:05131.
21. A. Hajnal and E. Szemerédi, "Proof of a conjecture of P. Erdos," Combinatorial Theory and Its Applications II, Proc Colloq, Balatonfüred, 1969, 601-623. North-Holland, Amsterdam, 1970, MR 45 #6661.
22. P. E. Haxell, Y. Kohayakawa, and T. Łuczak, The induced size-Ramsey number of cycles, Combinat Probab Comput 4(3) (1995), 217-239, MR 96h:05140.
23. P. E. Haxell, Y. Kohayakawa, and T. Łuczak, Turán's extremal problem in random graphs: Forbidding even cycles, J Combinat Theor Ser B 64(2) (1995), 273-287, MR 96e:05151.
24. P. E. Haxell, Y. Kohayakawa, and T. Łuczak, Turán's extremal problem in random graphs: Forbidding odd cycles, Combinatorica 16(1) (1996), 107-122, MR 97k:05180.
25. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley-Interscience, New York, 2000, MR 2001k:05180.
26. Y. Kohayakawa, "Szemerédi's regularity lemma for sparse graphs," Foundations of Computational Mathematics, Rio de Janeiro, 1997, 216-230. Springer-Verlag, Berlin, 1997, MR 99g:05145.
27. Y. Kohayakawa and B. Kreuter, Threshold functions for asymmetric Ramsey properties involving cycles, Random Struct Alg 11(3) (1997), 245-276, MR 99g:05159.
28. Y. Kohayakawa, B. Kreuter, and A. Steger, An extremal problem for random graphs and the number of graphs with large even-girth, Combinatorica 18(1) (1998), 101-120, MR 2000b: 05118.
29. Y. Kohayakawa, T. Łuczak, and V. Rödl, Arithmetic progressions of length three in subsets of a random set, Acta Arith 75(2) (1996), 133-163, MR 97b:11011.
30. 4-free subgraphs of random graphs, Combinatorica 17(2) (1997), 173-213, MR 98h:05166.
31. Y. Kohayakawa and V. Rödl, Regular pairs in sparse random graphs II, in preparation, 2001.
32. Y. Kohayakawa, V. Rödl, and E. Szemerédi, The size-Ramsey number of graphs of bounded degree, in preparation, 2003.
33. J. Komlós and M. Simonovits, "Szemerédi's regularity lemma and its applications in graph theory," Combinatorics - Paul Erdos is eighty, Vol. 2, Keszthely, 1993, Eds. D. Miklós, V. T. Sos, and T. Szonyi, 295-352. János Bolyai Mathematical Society, Budapest, 1996, MR 97d:05172.
34. T. Łuczak, personal communication, 1994.
35. T. Łuczak, A. Ruciński, and B. Voigt, Ramsey properties of random graphs, J Combinat Theory Ser B 56(1) (1992), 55-68, MR 94b:05172.
36. V. Rödl, On universality of graphs with uniformly distributed edges, Discrete Math 59(1-2) (1986), 125-134, MR 88b:05098.
37. V. Rödl, A. Ruciński, and A. Taraz, Hypergraph packing and graph embedding, Combinat Probab Comput 8(4) (1999), 363-376, MR 2000m:05164.
38. V. Rödl and A. Ruciński, Lower bounds on probability thresholds for Ramsey properties, Combinatorics - Paul Erdos is eighty, Vol. 1, Keszthely, 1993, Eds. D. Miklós, V. T. Sos, and T. Szonyi, 317-346. Bolyai Society Mathematical Studies, János Bolyai Mathematical Society, Budapest, 1993, MR 95b:05150.
39. V. Rödl and A. Ruciński, Random graphs with monochromatic triangles in every edge coloring, Random Struct Alg 5(2) (1994), 253-270, MR 95a:05102.
40. V. Rödl and A. Ruciński, Threshold functions for Ramsey properties, J Am Math Soc 8(4) (1995), 917-942, MR 96h:05141.
41. V. Rödl and A. Ruciński, Rado partition theorem for random subsets of integers, Proc London Math Soc 74(3) (1997), 481-502, MR 98d:05147.
42. V. Rödl and A. Ruciński, Ramsey properties of random hypergraphs, J Combinat Theor Ser A 81(1) (1998), 1-33, MR 98m:05175.
43. V. Rödl and E. Szemerédi, On size Ramsey numbers of graphs with bounded degree, Combinatorica 20(2) (2000), 257-262, MR 2001d:05122.
44. J. Spencer, Three hundred million points suffice, J Combinat Theor Ser A 49(2) (1988), 210-217, MR 90b:05116a.
45. J. Spencer, Erratum: "Three hundred million points suffice," J Combinat Theor Ser A 50(2) (1989), 323, MR 90b:05116b.
46. E. Szemerédi, "Regular partitions of graphs," Problèmes combinatoires et théorie des graphes, Colloq Int CNRS, Univ Orsay, Orsay, 1976, 399-401. CNRS, Paris, 1978, MR 81i:05095.
47. A. G. Thomason, "Pseudorandom graphs," Random graphs '85, Poznań, 1985, North-Holland Mathematical Studies, Vol. 144, 307-331. North-Holland, Amsterdam, 1987, MR 89d:05158.
48. A. G. Thomason, Random graphs, strongly regular graphs and pseudorandom graphs, Surveys in Combinatorics 1987, Ed. C. Whitehead, London Mathematical Society Lecture Note Series, Vol. 123, 173-195. Cambridge University Press, Cambridge, New York, 1987, MR 88m: 05072.