Academic Journal
Color-Bias Perfect Matchings in Hypergraphs
| Τίτλος: | Color-Bias Perfect Matchings in Hypergraphs |
|---|---|
| Συγγραφείς: | Hàn, Hiêp, Lang, Richard Johannes, Marciano, João Pedro, Pavez Signé, Matías, Sanhueza Matamala, Nicolás, Treglown, Andrew, Zárate Guerén, Camila |
| Πηγή: | SIAM Journal on Discrete Mathematics. 39:1894-1916 |
| Publication Status: | Preprint |
| Στοιχεία εκδότη: | Society for Industrial & Applied Mathematics (SIAM), 2025. |
| Έτος έκδοσης: | 2025 |
| Θεματικοί όροι: | Graph theory, Perfect matchings, Grafs, Teoria de, Combinatorics, FOS: Mathematics, Classificació AMS::05 Combinatorics::05C Graph theory, Combinatorics (math.CO), Discrepancy, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs, Color-bias |
| Περιγραφή: | 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. 22 pages, 1 figure. Author accepted manuscript, to appear in the SIAM Journal on Discrete Mathematics |
| Τύπος εγγράφου: | Article |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| ISSN: | 1095-7146 0895-4801 |
| DOI: | 10.1137/24m170483x |
| DOI: | 10.48550/arxiv.2408.11016 |
| Σύνδεσμος πρόσβασης: | http://arxiv.org/abs/2408.11016 |
| Rights: | arXiv Non-Exclusive Distribution CC BY |
| Αριθμός Καταχώρησης: | edsair.doi.dedup.....dfe7a1bbe49d2b64d78c6e08206d875e |
| Βάση Δεδομένων: | OpenAIRE |
| ISSN: | 10957146 08954801 |
|---|---|
| DOI: | 10.1137/24m170483x |