Increasing the chromatic number of a random graph

Details Increasing the chromatic number of a random graph Increasing the chromatic number of a random graph

2010-02-09

arxiv.org/abs/1002.1748v1

Mathematics

Combinatorics

Scientific paper

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.01 \chi$ vertices, thus creating a clique of chromatic number $1.01 \chi$. This requires, with high probability, the addition of $\Omega(n^2/\log^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.

Affiliated with

Also associated with

No associations

Rating

Increasing the chromatic number of a random graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Increasing the chromatic number of a random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Increasing the chromatic number of a random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124092