A better lower bound on average degree of 4-list-critical graphs
classification
🧮 math.CO
keywords
boundlist-criticalaveragedegreegraphsbestbetterevery
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.