Hadwiger’s Conjecture

Paul Seymour ()
Additional contact information
Paul Seymour: Princeton University

A chapter in Open Problems in Mathematics, 2016, pp 417-437 from Springer

Abstract: 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 four-colour theorem, and is probably the most famous open problem in graph theory.

Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-32162-2_13

Ordering information: This item can be ordered from
http://www.springer.com/9783319321622

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

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().