A Better Lower Bound on Average Degree of Online $k$-List-Critical Graphs

Electronic Journal Of Combinatorics

Landon Rabern¹ 

关键词: List colouring;    Online list colouring;    Average degree;    Critical graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We improve the best known bounds on average degree of online $k$-list-critical graphs for $k \geqslant 6$. Specifically, for $k \geqslant 7$ we show that every non-complete online $k$-list-critical graph has average degree at least $k-1 + \frac{(k-3)^2 (2

【 授权许可】

Others