Hadwiger’s conjecture

Paul Seymour

doi:10.1007/978-3-319-32162-2_13

Hadwiger’s conjecture

Paul Seymour

Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter

40 Scopus citations

Abstract

This is a survey of Hadwiger’s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This is a tremendous strengthening of the fourcolour theorem, and is probably the most famous open problem in graph theory.

Original language	English (US)
Title of host publication	Open Problems in Mathematics
Publisher	Springer International Publishing
Pages	417-437
Number of pages	21
ISBN (Electronic)	9783319321622
ISBN (Print)	9783319321608
DOIs	https://doi.org/10.1007/978-3-319-32162-2_13
State	Published - Jan 1 2016

All Science Journal Classification (ASJC) codes

General Economics, Econometrics and Finance
General Business, Management and Accounting
General Mathematics

Access to Document

10.1007/978-3-319-32162-2_13

Cite this

@inbook{fe2227cfcc0e48d68373dd4884cb498d,

title = "Hadwiger{\textquoteright}s conjecture",

abstract = "This is a survey of Hadwiger{\textquoteright}s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This is a tremendous strengthening of the fourcolour theorem, and is probably the most famous open problem in graph theory.",

author = "Paul Seymour",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-3-319-32162-2_13",

language = "English (US)",

isbn = "9783319321608",

pages = "417--437",

booktitle = "Open Problems in Mathematics",

publisher = "Springer International Publishing",

}

TY - CHAP

T1 - Hadwiger’s conjecture

AU - Seymour, Paul

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - This is a survey of Hadwiger’s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This is a tremendous strengthening of the fourcolour theorem, and is probably the most famous open problem in graph theory.

AB - This is a survey of Hadwiger’s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This is a tremendous strengthening of the fourcolour theorem, and is probably the most famous open problem in graph theory.

UR - http://www.scopus.com/inward/record.url?scp=84996798182&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84996798182&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-32162-2_13

DO - 10.1007/978-3-319-32162-2_13

M3 - Chapter

AN - SCOPUS:84996798182

SN - 9783319321608

SP - 417

EP - 437

BT - Open Problems in Mathematics

PB - Springer International Publishing

ER -

Hadwiger’s conjecture

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this