A Better Lower Bound on Average Degree of 4-List-Critical Graphs Landon Rabern DOI: https://doi.org/10.37236/5971 Keywords: Average degree, Critical graphs Abstract This short note proves that every non-complete $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. PDF Published 2016-08-19 Issue Volume 23, Issue 3 (2016) Article Number P3.37