Colour-balanced k-edge-coloured K_{2kt} has a perfect matching adjustable to colour-balance by recolouring O(k^2) edges.
AproofoftheRyser-Brualdi-Steinconjectureforlargeeven n
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Entropy-based upper bounds on A-perfect matchings in uniform bipartite hypergraphs with bounded codegree yield (n/e^{2.117})^n transversals for odd-order Latin squares with n ≡ 0 mod 3 and ((1+o(1))q/e^k)^{Dn/k} proper q-edge-colorings for k-uniform D-regular hypergraphs with q ≈ D and small codeg
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.
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.
-
Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs
Entropy-based upper bounds on A-perfect matchings in uniform bipartite hypergraphs with bounded codegree yield (n/e^{2.117})^n transversals for odd-order Latin squares with n ≡ 0 mod 3 and ((1+o(1))q/e^k)^{Dn/k} proper q-edge-colorings for k-uniform D-regular hypergraphs with q ≈ D and small codeg
-
Transversal Structures in Graph Systems: A Survey
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.