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.
Zero-sum copies of spanning forests in zero-sum complete graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2representative citing papers
Proves two CISTs exist in every 3-connected 2-outerplanar triangulated disc, supplies conditions for 3-outerplanar cases, and exhibits a 4-outerplanar counterexample.
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.
-
Completely Independent Spanning Trees in $k$-Outerplanar Triangulated Discs
Proves two CISTs exist in every 3-connected 2-outerplanar triangulated disc, supplies conditions for 3-outerplanar cases, and exhibits a 4-outerplanar counterexample.