Geodesic
Disproof of the list Hadwiger conjecture
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The List Hadwiger Conjecture asserts that every $K_t$-minor-free graph is $t$-choosable. We disprove this conjecture by constructing a $K_{3t+2}$-minor-free graph that is not $4t$-choosable for every integer $t\geq 1$.
DOI : 10.37236/719
Classification : 05C83, 05C15
Mots-clés : choosable \(K_t\)-minor-free graph 
@article{10_37236_719,
     author = {J\'anos Bar\'at and Gwena\"el Joret and David R. Wood},
     title = {Disproof of the list {Hadwiger} conjecture},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/719},
     zbl = {1243.05224},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/719/}
}
TY  - JOUR
AU  - János Barát
AU  - Gwenaël Joret
AU  - David R. Wood
TI  - Disproof of the list Hadwiger conjecture
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/719/
DO  - 10.37236/719
ID  - 10_37236_719
ER  - 
%0 Journal Article
%A János Barát
%A Gwenaël Joret
%A David R. Wood
%T Disproof of the list Hadwiger conjecture
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/719/
%R 10.37236/719
%F 10_37236_719
János Barát; Gwenaël Joret; David R. Wood. Disproof of the list Hadwiger conjecture. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/719

Cité par Sources :