Colour-balanced k-edge-coloured K_{2kt} has a perfect matching adjustable to colour-balance by recolouring O(k^2) edges.
Zero-sum problems—a survey
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves R(G, Z_p) ≤ n + 6p - 9 for n-vertex graphs G with (p-1)-sized 2-packing when p prime divides e(G) and minimum degree at least 1.
citing papers explorer
-
Colour-balanced subgraphs
Colour-balanced k-edge-coloured K_{2kt} has a perfect matching adjustable to colour-balance by recolouring O(k^2) edges.
-
A linear upper bound on the $\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing
Proves R(G, Z_p) ≤ n + 6p - 9 for n-vertex graphs G with (p-1)-sized 2-packing when p prime divides e(G) and minimum degree at least 1.