Note on the number of proper colorings of a graph

Details Note on the number of proper colorings of a graph Note on the number of proper colorings of a graph

2006-09-06

arxiv.org/abs/math/0609179v1

Mathematics

Combinatorics

3 pages. Not to be submitted!

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Note on the number of proper colorings of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Note on the number of proper colorings of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Note on the number of proper colorings of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418933