Colour-bias perfect matchings in hypergraphs.

Abstract: We study conditions under which an r-edge-coloured k-uniform hypergraph has a perfect matching that contains substantially more than n/(kr) monochromatic edges. Our main result solves this problem for perfect matchings under minimum degree conditions, which answers recent questions of Gishboliner, Glock and Sgueglia. This is joint work with Hiêp Hàn, Richard Lang, João Pedro Marciano, Matías Pavez-Signé, Andrew Treglown, and Camila Zárate-Guerén.

Date: Dec 20, 2024 at 10:00:00 h
Venue: Sala de Seminario John Von Neumann, CMM, Beauchef 851, Torre Norte, Piso 7.
Speaker: Nicolás Sanhueza Matamala
Affiliation: Universidad de Concepción
Coordinator: Matías Pavez
More info at:
Event website
Abstract:
PDF

Posted on Dec 18, 2024 in ACGO, Seminars