Colour-balanced k-edge-coloured K_{2kt} always admits a perfect matching with total colour deviation O(k^{2}), resolving Pardey–Rautenbach and improving all prior bounds for bounded-degree spanning subgraphs.
Sets on which several measures agree
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Colour-balanced subgraphs
Colour-balanced k-edge-coloured K_{2kt} always admits a perfect matching with total colour deviation O(k^{2}), resolving Pardey–Rautenbach and improving all prior bounds for bounded-degree spanning subgraphs.