Sparse Graphs Usually Have Exponentially Many Optimal Colorings
Keyword(s):
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.
2018 ◽
Vol 10
(04)
◽
pp. 1850045
Keyword(s):
2009 ◽
Vol 19
(1)
◽
pp. 87-98
◽
Keyword(s):
2003 ◽
Vol Vol. 6 no. 1
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 27
(2)
◽
pp. 191-200
Keyword(s):
Keyword(s):
1969 ◽
Vol 31
(2)
◽
pp. 303-309
2014 ◽
Vol 2014
◽
pp. 1-4
◽
Keyword(s):