Note on the number of proper colorings of a graph
Combinatorics
2007-05-23 v1 Number Theory
Abstract
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.
Keywords
Cite
@article{arxiv.math/0609179,
title = {Note on the number of proper colorings of a graph},
author = {Martin Klazar},
journal= {arXiv preprint arXiv:math/0609179},
year = {2007}
}
Comments
3 pages. Not to be submitted!