Color-bias perfect matchings in hypergraphs

We study conditions under which an edge-colored 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 Gishbol...

Descripción completa

Detalles Bibliográficos
Autores: Hàn, Hiêp, Lang, Richard Johannes|||0000-0002-7661-934X, Marciano, João Pedro, Pavez Signé, Matías, Sanhueza Matamala, Nicolás, Treglown, Andrew, Zárate Guerén, Camila
Tipo de recurso: artículo
Fecha de publicación:2025
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/459261
Acceso en línea:https://hdl.handle.net/2117/459261
https://dx.doi.org/10.1137/24M170483X
Access Level:acceso abierto
Palabra clave:Graph theory
Perfect matchings
Discrepancy
Color-bias
Grafs, Teoria de
Classificació AMS::05 Combinatorics::05C Graph theory
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
Descripción
Sumario:We study conditions under which an edge-colored 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.

Similares en LA Referencia