A note on Hadwiger's conjecture: Another proof that every 4-chromatic graph has a $K_4$ minor
Combinatorics
2023-08-11 v1
Abstract
The first non-obvious case of Hadwiger's Conjecture states that every graph with chromatic number at least 4 has a minor. We give a new proof that derives the minor from a proper 3-coloring of a subgraph of .
Cite
@article{arxiv.2308.05277,
title = {A note on Hadwiger's conjecture: Another proof that every 4-chromatic graph has a $K_4$ minor},
author = {Daniel Cooper McDonald},
journal= {arXiv preprint arXiv:2308.05277},
year = {2023}
}
Comments
2 pages