On triangle-free random graphs

Random Structures and Algorithms

Volumn 16, Issue 3, 2000, Pages 260-276

  ŁUczak, Tomasz ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034344099     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200005)16:3<260::AID-RSA3>3.0.CO;2-Q     Document Type: Article

References (16)

1. B. Bollobás, Random graphs, Academic Press, London, 1985.
2. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
3. R. Diestel, Graph Theory, Springer-Verlag, New York, 1997.
4. Z. Füredi, Random Ramsey graphs for the four-cycle, Discrete Math, 126 (1994) 407-410.
5. P.E. Maxell, Y. Kohayakawa, and T. Łuczak, Turán's extremal problem in random graphs: Forbidding even cycles, J Combin Theory Ser. B 64 (1995), 273-287.
6. S. Janson, T. Łuczak, and A. Ruciński, An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, Proc. Random Graphs '87, Wiley, Chichester, 1990, pp. 73-88.
7. D.J. Kleitman and K.J. Winston, On the number of graphs without 4-cycles, Discrete Math 41 (1982), 167-172.
8. Y. Kohayakawa, Szemerédi's regularity lemma for sparse graphs in Foundations of Computational Mathematics, F. Cucker and M. Shub (Editors), Springer-Verlag Berlin 1997, pp. 216-230.
9. Y. Kohayakawa and B. Kreuter, Threshold functions for asymmetric Ramsey properties involving cycles, Random Struct Alg 11 (1997), 245-276.
10. Y. Kohayakawa, B. Kreuter, and A. Steger, An extremal problem for random graphs and the number of graphs with large even-girth, Combinatorica 18 (1998), 101-120.
11. Y. Kohayakawa, T. Łuczak, and V. Rödl, Arithmetic progressions of length three in subsets of a random set, Acta Arith LXXV, 1996, 133-163.
12. 4-free subgraphs of random graphs, Combinatorica 17 (1997), 173-213.
13. B. Kreuter, Probabilistic versions of Ramsey's and Turán's theorems, Ph.D. Dissertation, Mathematisch-Naturwissenschaftlichen Fakultät II, Institut für Informatik, Humboldt-Universität, Berlin, 1997.
14. H.J. Prömel and A. Steger, On the asymptotic structure of sparse triangle free graphs, J Graph Theory 21 (1996), 137-151.
15. H.J. Prömel and A. Steger, Counting H-free graphs, Discrete Math 154 (1996), 311-315.
16. E. Szemerédi, "Regular partitions of graphs," Problèmes Combinatoires et Théorie des Graphes, Proc. Colloque Inter. CNRS, J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau (Editors), Paris, 1978, pp. 399-401.