Colour-bias perfect matchings in hypergraphs
Abstract
We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main result solves this problem for perfect matchings under minimum degree conditions. This answers recent questions of Gishboliner, Glock and Sgueglia, and of Balogh, Treglown and Z\'arate-Guer\'en.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.