All graphs are majority 3-choosable
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912367819882496 |
|---|---|
| author | Ouborny, Jan Pitz, Max |
| author_facet | Ouborny, Jan Pitz, Max |
| contents | Every graph is majority 3-choosable. This generalises the result by Shelah-Milner that every graph has an unfriendly 3-partition, confirming a conjecture of Haslegrave from 2020. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06031 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | All graphs are majority 3-choosable Ouborny, Jan Pitz, Max Combinatorics 05C15 (Primary) 05C63 (Secondary) Every graph is majority 3-choosable. This generalises the result by Shelah-Milner that every graph has an unfriendly 3-partition, confirming a conjecture of Haslegrave from 2020. |
| title | All graphs are majority 3-choosable |
| topic | Combinatorics 05C15 (Primary) 05C63 (Secondary) |
| url | https://arxiv.org/abs/2505.06031 |