Sparse graphs usually have exponentially many optimal colorings

Michael Krivelevich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


A proper coloring of a graph G = (V,E) is called optimal if the number of colors used is the minimal possible; i.e., it coincides with the chromatic number of G. We investigate the typical behavior of the number of distinct optimal colorings of a random graph G(n, p), for various values of the edge probability p = p(n). Our main result shows that for every constant 1/3 < a < 2, most of the graphs in the probability space G(n, p) with p = n -a have exponentially many optimal colorings.

Original languageEnglish
Pages (from-to)1-8
Number of pages8
JournalElectronic Journal of Combinatorics
Issue number1 R
StatePublished - 2002


Dive into the research topics of 'Sparse graphs usually have exponentially many optimal colorings'. Together they form a unique fingerprint.

Cite this