Hadwiger's Conjecture with Certain Forbidden Induced Subgraphs
Abstract
We prove that \K3, H\-free graphs are not counterexamples to Hadwiger's Conjecture, where H is any one of 33 graphs on seven, eight, or nine vertices, or H=K8. This improves on past results of Plummer-Stiebitz-Toft, Kriesell, and Bosse. The proofs are mostly computer-assisted.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.