{"paper":{"title":"A better lower bound on average degree of k-list-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2016-08-24T23:57:09Z","abstract_excerpt":"We improve the best known bounds on average degree of $k$-list-critical graphs for $k \\ge 6$. Specifically, for $k \\ge 7$ we show that every non-complete $k$-list-critical graph has average degree at least $k-1 + \\frac{(k-3)^2 (2 k-3)}{k^4-2 k^3-11 k^2+28 k-14}$ and every non-complete $6$-list-critical graph has average degree at least $5 + \\frac{93}{766}$. The same bounds hold for online $k$-list-critical graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06989","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}