Hadwiger’s conjecture

Research output: Chapter in Book/Report/Conference proceedingChapter

13 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 languageEnglish (US)
Title of host publicationOpen Problems in Mathematics
PublisherSpringer International Publishing
Pages417-437
Number of pages21
ISBN (Electronic)9783319321622
ISBN (Print)9783319321608
DOIs
StatePublished - Jan 1 2016

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Economics, Econometrics and Finance(all)
  • Business, Management and Accounting(all)

Fingerprint Dive into the research topics of 'Hadwiger’s conjecture'. Together they form a unique fingerprint.

Cite this