A better lower bound on average degree of 4-list-critical graphs (Q311559)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better lower bound on average degree of 4-list-critical graphs |
scientific article |
Statements
A better lower bound on average degree of 4-list-critical graphs (English)
0 references
13 September 2016
0 references
Summary: 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.
0 references
average degree
0 references
critical graphs
0 references
0 references
