Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs

Zi-Xia Song, Thomas Tibbetts

A dominating $K_t$ minor in a graph $G$ is a sequence $(T_1,\dots ,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1\le i<j\le t$, every vertex in…