A hypergraph bandwidth theorem
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914432054984704 |
|---|---|
| author | Lang, Richard Sanhueza-Matamala, Nicolás |
| author_facet | Lang, Richard Sanhueza-Matamala, Nicolás |
| contents | A cornerstone of extremal graph theory due to Erdős and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this phenomenon generalises to vertex-spanning structures such as Hamilton cycles. This was confirmed by Böttcher, Schacht and Taraz for graphs in the form of the Bandwidth Theorem. Our main result extends the phenomenon to hypergraphs.
A graph on $n$ vertices that robustly contains a Hamilton cycle must satisfy certain conditions on space, connectivity and aperiodicity. Conversely, we show that if these properties are robustly satisfied, then all blow-ups of cycles on $n$ vertices with clusters of size at most $\operatorname{poly}(\log \log n)$ are guaranteed as subgraphs. This generalises to powers of cycles and to the hypergraph setting.
As an application, we recover a series of classic results and recent breakthroughs on Hamiltonicity under degree conditions, which are then immediately upgraded to blown up versions. The proofs are based on a new setup for embedding large substructures into dense hypergraphs, which is of independent interest and does not rely on the Regularity Lemma or the Absorption Method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_14891 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A hypergraph bandwidth theorem Lang, Richard Sanhueza-Matamala, Nicolás Combinatorics A cornerstone of extremal graph theory due to Erdős and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this phenomenon generalises to vertex-spanning structures such as Hamilton cycles. This was confirmed by Böttcher, Schacht and Taraz for graphs in the form of the Bandwidth Theorem. Our main result extends the phenomenon to hypergraphs. A graph on $n$ vertices that robustly contains a Hamilton cycle must satisfy certain conditions on space, connectivity and aperiodicity. Conversely, we show that if these properties are robustly satisfied, then all blow-ups of cycles on $n$ vertices with clusters of size at most $\operatorname{poly}(\log \log n)$ are guaranteed as subgraphs. This generalises to powers of cycles and to the hypergraph setting. As an application, we recover a series of classic results and recent breakthroughs on Hamiltonicity under degree conditions, which are then immediately upgraded to blown up versions. The proofs are based on a new setup for embedding large substructures into dense hypergraphs, which is of independent interest and does not rely on the Regularity Lemma or the Absorption Method. |
| title | A hypergraph bandwidth theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.14891 |