Colour-bias perfect matchings in hypergraphs
Colour-bias perfect matchings in hypergraphs
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árate-Guerén.
Richard Lang、João Pedro Marciano、Matías Pavez-Signé、Nicolás Sanhueza-Matamala、Hiêp Hàn、Camila Zárate-Guerén、Andrew Treglown
数学
Richard Lang,João Pedro Marciano,Matías Pavez-Signé,Nicolás Sanhueza-Matamala,Hiêp Hàn,Camila Zárate-Guerén,Andrew Treglown.Colour-bias perfect matchings in hypergraphs[EB/OL].(2025-06-30)[2025-07-18].https://arxiv.org/abs/2408.11016.点此复制
评论