arXiv Analytics

Sign in

arXiv:math/0609179 [math.CO]AbstractReferencesReviewsResources

Note on the number of proper colorings of a graph

Martin Klazar

Published 2006-09-06Version 1

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.

Comments: 3 pages. Not to be submitted!
Categories: math.CO, math.NT
Subjects: 05C15
Related articles: Most relevant | Search more
arXiv:1111.1558 [math.CO] (Published 2011-11-07)
On proper colorings of hypergraphs
arXiv:2203.02040 [math.CO] (Published 2022-03-03)
A note on the conflict-free chromatic index
arXiv:2203.02980 [math.CO] (Published 2022-03-06)
On triangle-free list assignments

Links

Toolbox