Abstract
A Hamilton Berge cycle of a hypergraph on $n$ vertices is an alternating sequence $(v_1, e_1, v_2, \ldots, v_n, e_n)$ of distinct vertices $v_1, \ldots, v_n$ and distinct hyperedges $e_1, \ldots, e_n$ such that $\{v_1,v_n\}\subseteq e_n$ and $\{v_i, v_{i+1}\} \subseteq e_i$ for every $i\in [n-1]$. We prove the following Dirac-type theorem about Berge cycles in the binomial random $r$-uniform hypergraph $H^{(r)}(n,p)$: for every integer $r \geq 3$, every real $\gamma>0$ and $p \geq \frac{\ln^{17r} n}{n^{r-1}}$ asymptotically almost surely, every spanning subgraph $H \subseteq H^{(r)}(n,p)$ with minimum vertex degree $\delta_1(H) \geq \left(\frac{1}{2^{r-1}} + \gamma\right) p \binom{n}{r-1}$ contains a Hamilton Berge cycle. The minimum degree condition is asymptotically tight and the bound on $p$ is optimal up to some polylogarithmic factor.
Highlights
Many classical theorems of extremal graph theory give sufficient optimal minimum degree conditions for graphs to contain copies of large or even spanning structures
The systematic study of those with respect to various graph properties was initiated by Sudakov and Vu in [25], who in particular proved that G(n, p) has resilience at least 1/2 − o(1) with respect to Hamiltonicity a.a.s. for p > ln4 n/n
Like in the setting of graphs, a natural question is which sparse random hypergraphs contain a weak Hamilton cycle or even a Hamilton Berge cycle and how robust these hypergraphs are with respect to these properties? Recall that by H(r)(n, p) we denote the random r-uniform hypergraph model on the vertex set [n], where each set of r vertices forms an edge randomly and independently with probability p = p(n)
Summary
Many classical theorems of extremal graph theory give sufficient optimal minimum degree conditions for graphs to contain copies of large or even spanning structures. + n − 1 H contains a Hamilton Berge cycle In any case, it follows from Propositions 2 and 3 that the resilience of the complete hypergraph Kn(r) is at least 1−21−r −o(1) with respect to both weak and Berge Hamiltonicity. Like in the setting of graphs, a natural question is which sparse random hypergraphs contain a weak Hamilton cycle or even a Hamilton Berge cycle and how robust these hypergraphs are with respect to these properties? In this paper we prove the following Dirac-type result for the existence of Hamilton Berge cycles in random hypergraphs. Berge cycles to a problem of finding a Hamilton cycle in the random graph to achieve the same resilience 1 − 21−r + o(1) in the random hypergraph H(r)(n, p) One possibility of such a ‘reduction’ would be to declare an edge uv ∈.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have