Note on the number of proper colorings of a graph
Abstract
Description
We present a simpler proof of a bound on the number of proper colorings of a graph that was obtained recently by Liu and Murty using Tur'an sieve (in fact, we prove a stronger inequality). We also point out that these results are subsumed in a stronger result due to Lazebnik in 1990.
3 pages. Not to be submitted!
3 pages. Not to be submitted!