A better lower bound on average degree of 4-list-critical graphs
Abstract
This short note proves that every incomplete k-list-critical graph has average degree at least k-1 + k-3k2-2k+2. This improves the best known bound for k = 4,5,6. The same bound holds for online k-list-critical graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.