Obligatory hypergraphs
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909139455705088 |
|---|---|
| author | Reiher, Christian |
| author_facet | Reiher, Christian |
| contents | Erdős and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_11223 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Obligatory hypergraphs Reiher, Christian Combinatorics Logic 03E05, 05C15, 05D10 Erdős and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs. |
| title | Obligatory hypergraphs |
| topic | Combinatorics Logic 03E05, 05C15, 05D10 |
| url | https://arxiv.org/abs/2403.11223 |