On the evolution of triangle-free graphs

Combinatorics Probability and Computing

Volumn 14, Issue 1-2, 2005, Pages 211-224

  Steger, Angelika ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILISTIC LOGICS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

BIPARTITE; FREE GRAPHS; LOGARITHMS; TRIANGLES;

GRAPH THEORY;

EID: 14544286038     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006613     Document Type: Article

References (9)

1. n-free graphs. In International Colloquium on Combinatorial Theory, Atti del Convegni Lincei 17, Vol. 2, Rome, pp. 19-27.
2. Janson, S., Łuczak, T. and Ruciński, A. (1990) An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In Random Graphs '87 (M. Karoński, J. Jaworski and A. Ruciński, eds), Wiley, Chichester, pp. 73-87.
3. Kohayakawa, Y. (1997) Szemerédi's regularity lemma for sparse graphs. In Foundations of Computational Mathematics, Springer, Berlin/Heidelberg, pp. 216-230.
4. Łuczak, T. (2000) On triangle-free random graphs. Random Struct. Alg. 16 260-276.
5. Osthus, D. Prömel, H. J. and Taraz, A. (2003) For which densities are random triangle-free graphs almost surely bipartite? Combinatorica 23 201-250.
6. Osthus, D. Prömel, H. J. and Taraz, A. (2001) Almost all graphs of high girth and suitable density have high chromatic number. J. Graph Theory 37 220-226.
7. Prömel, H. J. and Steger, A. (1995) Random l-colorable graphs. Random Struct. Alg. 6 21-37.
8. Prömel, H. J. and Steger, A. (1996) On the asymptotic structure of sparse triangle-free graphs. J. Graph Theory 21 137-151.
9. Wormald, N. (1996) The perturbation method and triangle-free graphs. Random Struct. Alg. 9 253-270.