Hadwiger conjectured that every graph contains Kχ(G) as a minor, where χ(G) is the chromatic number of G. In 2005, Robertson made a weaker conjecture that for any graph G, there exists a graph H with the same degree sequence of G and containing Kχ(G) as a minor, which was confirmed by Dvořák and Mohar recently. In this note, we give a short proof of Robertson's Conjecture.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics