Almost all graphs with high girth and suitable density have high chromatic number

Journal of Graph Theory

Volumn 37, Issue 4, 2001, Pages 220-226

  Osthus, Deryk ^a,b   Prömel, Hans Jürgen ^a   Taraz, Anusch ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b Graduate School Algorithmische Diskrete Mathematik   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244435736     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1017     Document Type: Article

References (10)

1. M. Ajtai, J. Komlós, and E. Szemerédi, A note on Ramsey numbers, J Combin Theory Ser A 29 (1980), 354-360.
2. B. Bollobás, Random Graphs, Academic Press, London, 1985.
3. J. A. Bondy and M. Simonovits, Cycles of even length in graphs, J Combin Theory Ser B 16 (1974), 97-105.
4. P. Erdös, Graph theory and probability, Can J Math 11 (1959), 34-38.
5. S. Janson, T. Łuczak, and A. Ruciński, Random Graphs, Wiley-Interscience, New York, 2000.
6. 2/log t, Random Struct Algorithms 7 (1995), 173-207.
7. M. Krivelevich, On the minimal number of edges in color-critical graphs, Combinatorica 17 (1997), 401-426.
8. D. Osthus, H. J. Prömel, and A. Taraz, For which densities are random triangle-free graphs almost surely bipartite? Combinatorica, to appear.
9. D. Osthus and A. Taraz, Random maximal H-free graphs, Random Struct Algorithms 18 (2001), 61-82.
10. H. J. Prömel and A. Steger, Counting H-free graphs, Discrete Math 154 (1996), 311-315.