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

DOI10.1002/jgt.1017zbMath0992.05040OpenAlexW2528392195MaRDI QIDQ2746204

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

Publication date: 11 September 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1017

zbMATH Keywords

chromatic numberhigh girth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A note on Ramsey numbers
• On the minimal number of edges in color-critical graphs
• Cycles of even length in graphs
• Counting \(H\)-free graphs
• Graph Theory and Probability
• Random maximalH-free graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Almost all graphs with high girth and suitable density have high chromatic number