Disproof of the List Hadwiger Conjecture

Details Disproof of the List Hadwiger Conjecture Disproof of the List Hadwiger Conjecture

2011-10-11

arxiv.org/abs/1110.2272v1

Electronic Journal of Combinatorics, 18/1:R232, 2011

Mathematics

Combinatorics

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

Disproof of the List Hadwiger Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Disproof of the List Hadwiger Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disproof of the List Hadwiger Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471467