Odd clique minors in graphs with independence number two

Yuqing Ji, Zi-Xia Song, Evan Weiss +1

A $K_t$-expansion consists of $t$ vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion odd if its vertices can be two-colored so that the edge…