{
  "id": "math/9805066",
  "version": "v1",
  "published": "1998-05-13T16:57:46.000Z",
  "updated": "1998-05-13T16:57:46.000Z",
  "title": "A Lower Bound for Partial List Colorings",
  "authors": [
    "Glenn G. Chappell"
  ],
  "comment": "4 pages, no figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Let G be an n-vertex graph with list-chromatic number $\\chi_\\ell$. Suppose each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas conjecture that at least $t n / {\\chi_\\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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1998-05-13T16:57:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "partial list colorings",
      "lower bound",
      "n-vertex graph",
      "haas conjecture",
      "list-chromatic number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1998math......5066C"
    }
  }
}