Increasing the chromatic number of a random graph

DOI10.4310/JOC.2010.V1.N4.A1zbMath1244.05194arXiv1002.1748WikidataQ105584509 ScholiaQ105584509MaRDI QIDQ547868

Noga Alon, Benjamin Sudakov

Publication date: 27 June 2011

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.1748

zbMATH Keywords

random graphadding edgesincrease of chromatic number

Mathematics Subject Classification ID

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

Related Items (4)

Dirac's theorem for random graphs ⋮ Long cycles in subgraphs of (pseudo)random directed graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Robust Hamiltonicity of Dirac graphs

This page was built for publication: Increasing the chromatic number of a random graph