A note on colour-bias perfect matchings in hypergraphs
Authors:
- József BaloghJBJózsef Balogh
- Andrew TreglownATAndrew Treglown
- Camila Zárate-GuerénCZCamila Zárate-Guerén
Preprint
Abstract
A result of Balogh, Csaba, Jing and Pluhár yields the minimum degree threshold that ensures a $2$-coloured graph contains a perfect matching of significant colour-bias (i.e., a perfect matching that contains significantly more than half of its edges in one colour). In this note we prove an analogous result for perfect matchings in $k$-uniform hypergraphs. More precisely, for each $2\leq \ell <k$ and $r\geq 2$ we determine the minimum $\ell$-degree threshold for forcing a perfect matching of significant colour-bias in an $r$-coloured $k$-uniform hypergraph.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Tight Hamilton cycles with high discrepancyCombinatorics, Probability and Computing, 2025
- Discrepancies of spanning trees and Hamilton cyclesJournal of Combinatorial Theory, Series B, 2022
- Color‐biased Hamilton cycles in random graphsRandom Structures & Algorithms, 2021
- A Note on Color-Bias Hamilton Cycles in Dense GraphsSIAM Journal on Discrete Mathematics, 2021
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs IIJournal of Combinatorial Theory, Series A, 2013
- Perfect matchings in large uniform hypergraphs with large minimum collective degreeJournal of Combinatorial Theory, Series A, 2009
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex DegreeSIAM Journal on Discrete Mathematics, 2009
- Perfect matchings in uniform hypergraphs with large minimum degreeEuropean Journal of Combinatorics, 2006
- Matchings in hypergraphs of large minimum degreeJournal of Graph Theory, 2005
- Imbalances in k‐colorationsNetworks, 1971