{
  "id": "1602.08532",
  "version": "v1",
  "published": "2016-02-26T23:55:42.000Z",
  "updated": "2016-02-26T23:55:42.000Z",
  "title": "A better lower bound on average degree of 4-list-critical graphs",
  "authors": [
    "Landon Rabern"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "This short note proves that every incomplete $k$-list-critical graph has average degree at least $k-1 + \\frac{k-3}{k^2-2k+2}$. This improves the best known bound for $k = 4,5,6$. The same bound holds for online $k$-list-critical graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-02-26T23:55:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "better lower bound",
      "average degree",
      "list-critical graph",
      "short note"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160208532R"
    }
  }
}