no. 17 · Wednesday 18 November 2026
Supersaturation and reconfiguration diameter of independent transversals
Abstract
Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree $Δ$. It is a classic result that when all parts have size at least $2Δ$, the collection is nonempty. Recently, it was found that if the parts have size at least $2Δ+1$, then every pair of independent transversals is connected, within the collection, by a sequence of one-vertex reconfigurations. We prove, among other results, that there are exponentially many independent transversals when the parts have size at least $2Δ$, and that the reconfiguration diameter is at most linear in the number of parts when the parts have size at least $4Δ$.
- comments
- 14 pages, 1 figure
- fields
- Combinatorics