On the chromatic number of a random 5-regular graph

DOI10.1002/jgt.20369zbMath1190.05069OpenAlexW4238782258WikidataQ57991452 ScholiaQ57991452MaRDI QIDQ3652529

Xavier Pérez, Lefteris M. Kirousis, Alexis C. Kaporis, G. D. Kemkes, Nicholas C. Wormald, Josep Diaz

Publication date: 18 December 2009

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

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

zbMATH Keywords

chromatic numberrandom graphrandom regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Lower bounds on the chromatic number of random graphs ⋮ On the chromatic number of random regular graphs ⋮ The cook-book approach to the differential equation method ⋮ On the chromatic number of random \(d\)-regular graphs ⋮ Random regular graphs of non-constant degree: concentration of the chromatic number

Cites Work

• Unnamed Item
• 3-star factors in random \(d\)-regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Colouring Random Regular Graphs
• Colouring Random 4-Regular Graphs
• Almost all graphs with average degree 4 are 3-colorable

This page was built for publication: On the chromatic number of a random 5-regular graph