Landon Rabern
Published 2016-02-26Version 1
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.
A better lower bound on average degree of k-list-critical graphs
A lower bound of the energy of non-singular graphs in terms of average degree
Short note on the convolution of binomial coefficients
![QR code for arXiv:1602.08532 [math.CO]](http://oss.arxitics.com/images/favicon.svg)