Ramsey--Dirac theory for bounded degree hypertrees
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910718115184640 |
|---|---|
| author | Han, Jie Im, Seonghyuk Kim, Jaehoon Yang, Donglei |
| author_facet | Han, Jie Im, Seonghyuk Kim, Jaehoon Yang, Donglei |
| contents | Ramsey--Turán theory considers Turán type questions in Ramsey-context, asking for the existence of a small subgraph in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, such as a clique of linear size. Similarly, one can consider Dirac-type questions in Ramsey context, asking for the existence of a spanning subgraph $H$ in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, which we call a Ramsey--Dirac theory question.
When $H$ is a connected spanning subgraph, the disjoint union $K_{n/2}\cup K_{n/2}$ of two large cliques shows that it is natural to consider complete bipartite graphs $F$. Indeed, Han, Hu, Ping, Wang, Wang and Yang in 2024 proved that if $G$ is an $n$-vertex graph with $δ(G)=Ω(n)$ where the complement $\overline{G}$ does not contain any complete bipartite graph $K_{m,m}$ with $m=Ω(n)$, then $G$ contains every $n$-vertex bounded degree tree $T$ as a subgraph.
Extending this result to the Ramsey--Dirac theory for hypertrees, we prove that if $G$ is an $n$-vertex $r$-uniform hypergraph with $δ(G)=Ω(n^{r-1})$ where the complement $\overline{G}$ does not contain any complete $r$-partite hypergraph $K_{m,m,\dots, m}$ with $m=Ω(n)$, then $G$ contains every $n$-vertex bounded degree hypertree $T$ as a subgraph. We also prove the existence of matchings and loose Hamilton cycles in the same setting, which extends the result of Mcdiarmid and Yolov into hypergraphs.
This result generalizes the universality result on randomly perturbed graphs by Böttcher, Han, Kohayakawa, Montgomery, Parczyk and Person in 2019 into hypergraphs and also strengthen the results on quasirandom hypergraphs by Lenz, Mubayi and Mycroft in 2016 and Lenz and Mubayi in 2016 into hypergraphs satisfying a much weaker pseudorandomness condition. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_17996 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Ramsey--Dirac theory for bounded degree hypertrees Han, Jie Im, Seonghyuk Kim, Jaehoon Yang, Donglei Combinatorics Ramsey--Turán theory considers Turán type questions in Ramsey-context, asking for the existence of a small subgraph in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, such as a clique of linear size. Similarly, one can consider Dirac-type questions in Ramsey context, asking for the existence of a spanning subgraph $H$ in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, which we call a Ramsey--Dirac theory question. When $H$ is a connected spanning subgraph, the disjoint union $K_{n/2}\cup K_{n/2}$ of two large cliques shows that it is natural to consider complete bipartite graphs $F$. Indeed, Han, Hu, Ping, Wang, Wang and Yang in 2024 proved that if $G$ is an $n$-vertex graph with $δ(G)=Ω(n)$ where the complement $\overline{G}$ does not contain any complete bipartite graph $K_{m,m}$ with $m=Ω(n)$, then $G$ contains every $n$-vertex bounded degree tree $T$ as a subgraph. Extending this result to the Ramsey--Dirac theory for hypertrees, we prove that if $G$ is an $n$-vertex $r$-uniform hypergraph with $δ(G)=Ω(n^{r-1})$ where the complement $\overline{G}$ does not contain any complete $r$-partite hypergraph $K_{m,m,\dots, m}$ with $m=Ω(n)$, then $G$ contains every $n$-vertex bounded degree hypertree $T$ as a subgraph. We also prove the existence of matchings and loose Hamilton cycles in the same setting, which extends the result of Mcdiarmid and Yolov into hypergraphs. This result generalizes the universality result on randomly perturbed graphs by Böttcher, Han, Kohayakawa, Montgomery, Parczyk and Person in 2019 into hypergraphs and also strengthen the results on quasirandom hypergraphs by Lenz, Mubayi and Mycroft in 2016 and Lenz and Mubayi in 2016 into hypergraphs satisfying a much weaker pseudorandomness condition. |
| title | Ramsey--Dirac theory for bounded degree hypertrees |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2411.17996 |