Increasing the chromatic number of a random graph

DOI10.4310/JOC.2010.V1.N4.A1zbMATH Open1244.05194arXiv1002.1748WikidataQ105584509 ScholiaQ105584509MaRDI QIDQ547868FDOQ547868

Authors: Noga Alon, Benny Sudakov 

Publication date: 27 June 2011

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

Abstract: What is the minimum number of edges that have to be added to the random graph $G=G_{n,0.5}$ in order to increase its chromatic number $chi=chi(G)$ by one percent ? One possibility is to add all missing edges on a set of $1.01chi$ vertices, thus creating a clique of chromatic number $1.01chi$. This requires, with high probability, the addition of $Omega(n^2/lo{g}^{2}n)$ edges. We show that this is tight up to a constant factor, consider the question for more general random graphs $G_{n,p}$ with $p=p(n)$, and study a local version of the question as well. The question is motivated by the study of the resilience of graph properties, initiated by the second author and Vu, and improves one of their results.

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

Recommendations

• On the chromatic number of random graphs
• On the chromatic number of random graphs
• scientific article; zbMATH DE number 3895112
• Adding edges to increase the chromatic number of a graph
• The chromatic number of random graphs

zbMATH Keywords

random graphadding edgesincrease of chromatic number

Mathematics Subject Classification ID

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

Cited In (5)

• Adding edges to increase the chromatic number of a graph
• Long cycles in subgraphs of (pseudo)random directed graphs
• Dirac's theorem for random graphs
• Robust Hamiltonicity of Dirac graphs
• Graph Tilings in Incompatibility Systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547868)