Colour-bias perfect matchings in hypergraphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912458533240832 |
|---|---|
| author | Hàn, Hiêp Lang, Richard Marciano, João Pedro Pavez-Signé, Matías Sanhueza-Matamala, Nicolás Treglown, Andrew Zárate-Guerén, Camila |
| author_facet | Hàn, Hiêp Lang, Richard Marciano, João Pedro Pavez-Signé, Matías Sanhueza-Matamala, Nicolás Treglown, Andrew Zárate-Guerén, Camila |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_11016 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Colour-bias perfect matchings in hypergraphs Hàn, Hiêp Lang, Richard Marciano, João Pedro Pavez-Signé, Matías Sanhueza-Matamala, Nicolás Treglown, Andrew Zárate-Guerén, Camila Combinatorics 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. |
| title | Colour-bias perfect matchings in hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.11016 |