Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free graphs

Abstract: We prove Hadwiger's Conjecture for ${\text{co-claw}, \text{co-gem}}$-free graphs and ${\text{fork}, \text{antifork}}$-free graphs, where the co-claw is the disjoint union of a triangle and a vertex, the co-gem is the disjoint union of a 4-vertex path and a vertex, the fork is obtained from $K_{1,3}$ by subdividing one of the edges, and the antifork is the complement of the fork. The ${\text{co-claw}, \text{co-gem}}$-free graphs include the complements of line graphs of triangle-free multigraphs, and thus our results imply Hadwiger's Conjecture for these graphs. In fact, we prove a stronger result: every ${\text{co-claw}, \text{co-gem}}$-free graph $G$ has a $K_{χ(G)}$-model where each branch set has size at most 2, and every ${\text{fork}, \text{antifork}}$-free graph $G$ has a $K_{χ(G)}$-model where at most one branch set has size greater than 2.