On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
The Hadwiger conjecture states that every \(k\)-chromatic graph has a \(K_{k}\)-minor. The author proves that for all positive integers \(k\), any minimal \(k\)-chromatic counterexample to Hadwiger's conjecture is \(\lceil 2k/27 \rceil\)-connected. This is the first result on the vertex connectivity of a minimal counterexample to Hadwiger's conjecture.
scientific article; zbMATH DE number 5115323
scientific article