Note on the number of proper colorings of a graph
| dc.creator | Klazar, Martin | |
| dc.date | 2006-09-06 | |
| dc.date.accessioned | 2026-07-07T07:24:35Z | |
| dc.date.available | 2026-07-07T07:24:35Z | |
| dc.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. | |
| dc.description | 3 pages. Not to be submitted! | |
| dc.identifier | https://arxiv.org/abs/math/0609179 | |
| dc.identifier | http://arxiv.org/abs/math/0609179 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116409 | |
| dc.subject | Combinatorics | |
| dc.subject | Number Theory | |
| dc.subject | 05C15 | |
| dc.title | Note on the number of proper colorings of a graph | |
| dc.type | text |