Disproof of the list Hadwiger conjecture
type: Item
instance of: scholarly article
title: Disproof of the list Hadwiger conjecture
zbMATH Open document ID: 1243.05224
author: János Barát
author: Gwenaël Joret
author: David R. Wood
published in: The Electronic Journal of Combinatorics
publication date: 2012-03-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1110.2272
full work available at URL: v18i1p232.html
review text: Summary: 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\).
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6012336
zbMATH Keywords: choosable \(K_t\)-minor-free graph
MaRDI profile type: MaRDI publication profile
arXiv ID: 1110.2272
description: scientific article