Every graph with no $K_7^{\vee}$-minor is $6$-colorable
Combinatorics
2025-07-08 v1
Abstract
Let denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger's conjecture, we prove that every graph with no -minor is -colorable.
Cite
@article{arxiv.2507.03244,
title = {Every graph with no $K_7^{\vee}$-minor is $6$-colorable},
author = {Sergey Norin and Agnes Totschnig},
journal= {arXiv preprint arXiv:2507.03244},
year = {2025}
}