Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2403.11223 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _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 |