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 Gishboliner, Glock, and Sgueglia and of Balogh, Treglown, and Zárate-Guerén.
Authors
- João Pedro Marciano (ORCID: https://orcid.org/0009-0000-5539-9061)
- Matías Pavez‐Signé (ORCID: https://orcid.org/0000-0001-9418-5058)
- Hiệp Hàn (ORCID: https://orcid.org/0000-0001-7757-7244)
- Nicolás Sanhueza‐Matamala (ORCID: https://orcid.org/0000-0003-4791-5710)
- Camila Zárate-Guerén
- Andrew Treglown (ORCID: https://orcid.org/0000-0002-4293-5678)
- Richard Lang (ORCID: https://orcid.org/0000-0002-7661-934X)
Institutions
- University of Concepción (CL)
- University of Chile (CL)
- University of Birmingham (GB)
- Universitat Politècnica de Catalunya (ES)
Publication Details
- Journal
- SIAM Journal on Discrete Mathematics
- Published
- 2025-09-16
- DOI
- https://doi.org/10.1137/24m170483x
- Citations
- 1
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 5.33