Reconfiguration of Independent Transversals

TL;DR

This paper proves that under certain conditions, all independent transversals in a graph can be transformed into each other through simple modifications, strengthening a classical theorem by Haxell.

Contribution

It establishes the connectivity of the reconfiguration graph of independent transversals when the block size exceeds twice the maximum degree, and characterizes cases where this connectivity fails.

Findings

Connectivity of the reconfiguration graph for independent transversals when t ≥ 2Δ+1.

Failure of connectivity characterized by disjoint unions of K_{Δ,Δ}.

Strengthening of Haxell's theorem on independent transversals.

Abstract

Given integers $\Delta\ge 2$ and $t\ge 2\Delta$, suppose there is a graph of maximum degree $\Delta$ and a partition of its vertices into blocks of size at least $t$. By a seminal result of Haxell, there must be some independent set of the graph that is transversal to the blocks, a so-called independent transversal. We show that, if moreover $t\ge2\Delta+1$, then every independent transversal can be transformed within the space of independent transversals to any other through a sequence of one-vertex modifications, showing connectivity of the so-called reconfigurability graph of independent transversals. This is sharp in that for $t=2\Delta$ (and $\Delta\ge 2$) the connectivity conclusion can fail. In this case we show furthermore that in an essential sense it can only fail for the disjoint union of copies of the complete bipartite graph $K_{\Delta,\Delta}$. This constitutes a qualitative strengthening of Haxell's theorem.