A Lower Bound for Partial List Colorings
| dc.creator | Chappell, Glenn G. | |
| dc.date | 1998-05-13 | |
| dc.date.accessioned | 2026-07-07T05:24:46Z | |
| dc.date.available | 2026-07-07T05:24:46Z | |
| dc.description | Let G be an n-vertex graph with list-chromatic number $χ_\ell$. Suppose each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas conjecture that at least $t n / {χ_\ell}$ vertices can be colored from these lists. We prove a lower bound for the number of colorable vertices. As a corollary, we show that at least 6/7 of the conjectured number can be colored. | |
| dc.description | 4 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/9805066 | |
| dc.identifier | http://arxiv.org/abs/math/9805066 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76929 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | A Lower Bound for Partial List Colorings | |
| dc.type | text |