Geodesic
A better lower bound on average degree of online \(k\)-list-critical graphs
The electronic journal of combinatorics, Tome 25 (2018) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 k-3)}{k^4-2 k^3-11 k^2+28 k-14}$ and every non-complete online $6$-list-critical graph has average degree at least $5 + \frac{93}{766}$. The same bounds hold for offline $k$-list-critical graphs.
DOI : 10.37236/6405
Classification : 05C15
Mots-clés : list colouring, online list colouring, average degree, critical graphs

Landon Rabern  1

1 IQVIA 
@article{10_37236_6405,
     author = {Landon Rabern},
     title = {A better lower bound on average degree of online \(k\)-list-critical graphs},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {1},
     doi = {10.37236/6405},
     zbl = {1391.05117},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6405/}
}
TY  - JOUR
AU  - Landon Rabern
TI  - A better lower bound on average degree of online \(k\)-list-critical graphs
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6405/
DO  - 10.37236/6405
ID  - 10_37236_6405
ER  - 
%0 Journal Article
%A Landon Rabern
%T A better lower bound on average degree of online \(k\)-list-critical graphs
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6405/
%R 10.37236/6405
%F 10_37236_6405
Landon Rabern. A better lower bound on average degree of online \(k\)-list-critical graphs. The electronic journal of combinatorics, Tome 25 (2018) no. 1. doi: 10.37236/6405

Cité par Sources :