A Dirac-type theorem for Berge cycles in random hypergraphs

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.


Introduction
Many classical theorems of extremal graph theory give sufficient optimal minimum degree conditions for graphs to contain copies of large or even spanning structures.Lately it became popular to phrase such extremal results in terms of local resilience, where the local resilience of a graph G with respect to a given monotone increasing graph property P is defined as the minimum number ρ ∈ R such that one can obtain a graph without property P by deleting at most ρ • deg(v) edges from every vertex v ∈ V (G).For instance, using this terminology, Dirac's theorem [9] says that the local resilience of the complete graph K n with respect to Hamiltonicity is 1/2 − o (1).
In recent years, an active and fruitful research direction in extremal and probabilistic combinatorics has become the study of resilience of random and pseudorandom structures.The systematic study of those with respect to various graph properties was initiated by Sudakov and Vu in [23], who in particular proved that G(n, p) (i.e. the Erdős-Renyi random graph model that is defined on the vertex set [n] with each pair of vertices forming an edge randomly and independently with probability p) has resilience at least 1/2 − o(1) with respect to Hamiltonicity a.a.s. for p > ln 4 n/n.This result was improved by Lee and Sudakov [17] to p ln n/n, which is essentially best possible with respect to both the constant 1/2 and the edge probability, since one can find a.a.s.disconnected spanning subgraphs of G(n, p) with degree at most (1/2 − o(1))pn and since G(n, p) itself is a.a.s.disconnected for p ≤ (1 − o(1)) ln n/n.
An r-uniform hypergraph is a tuple (V, E) with E ⊆ V r and thus the generalisation of a graph: the elements of V are called vertices and the elements of E hyperedges (or edges for short).It is therefore natural to ask for degree conditions that force a subhypergraph (or subgraph for short) of the complete hypergraph to contain a copy of some given large structure.Such problems have been studied extensively in the last years, especially for different kinds of Hamilton cycles.Furthermore, (bounds on) the threshold for the existence of a Hamilton cycle in the random r-uniform hypergraph model H (r) (n, p) (every possible edge appears with probability p independently of the others) have been determined for various notions of cycles.We refer to [16] for an excellent survey by Kühn and Osthus of such problems.
The purpose of this work is to provide a Dirac-type result in the random hypergraph H (r) (n, p).This result was announced and its proof sketched in [7] and is, to the best of our knowledge, the first local resilience result in random hypergraphs at an almost optimal edge probability.The only other resilience result in random hypergraphs is a recent work of Ferber and Hirschfeld [10] on the resilience of perfect matchings with respect to the codegree condition in random hypergraphs at the asymptotically optimal probability.
Given an r-uniform hypergraph H = (V, E).We use deg H (v) to denote the vertex degree of a vertex v in H, i.e. the number of hyperedges of H that contain v.The minimum vertex degree of a hypergraph H is then δ 1 (H) := min v deg H (v). We will also consider other degree notions such as deg H (T ) defined as |{e : e ⊇ T, e ∈ E(H)}|, i.e. the number of edges that contain a given tuple T .Generally, we define the maximum (∆ (H)) -collective degree as follows: The notion of resilience in graphs extends verbatim to the setting of hypergraphs.
We will be interested in resilience results of random r-uniform hypergraphs with respect to weak and Berge Hamiltonicity.Weak and Berge cycles are the earliest notion of cycles in hypergraphs and are defined as follows.
A weak cycle is called Berge cycle if all its hyperedges are distinct.
a weak cycle or a Berge cycle in a hypergraph H on n vertices, then P is called weak Hamilton cycle or Hamilton Berge cycle of H, respectively.Other common notion of cycles are -cycles.For an integer 1 ≤ ≤ r, an r-uniform hypergraph C is an -cycle if there exists a cyclic ordering of the vertices of C such that every hyperedge of C consists of r consecutive vertices and such that every pair of consecutive hyperedges intersects in precisely vertices.
If = 1, then C is called a loose cycle and if = r − 1, then C is called a tight cycle.Observe that every -cycle is a Berge cycle.Furthermore, every tight Hamilton cycle (i.e. a spanning tight cycle) is a Hamilton Berge cycle.This is however not true for -cycles if < r − 1 since a Hamilton -cycle in a hypergraph on n vertices has n/(r − ) hyperedges, whereas a Hamilton Berge cycle has n hyperedges.But since hyperedges may be repeated in weak cycles, a Hamilton -cycle is a weak Hamilton cycle.There is also an extensive literature on Dirac-type results that are stated in terms of the minimum degree for dense graphs and hypergraphs, we refer to the illuminating surveys [16,20,24].Surprisingly, until recently, the only result on the minimum vertex degree which implies the existence of a weak or a Berge Hamilton cycle was the one due to Bermond, Germa, Heydemann, and Sotteau [5].They proved that for every integer r ≥ 3 and k ≥ r + 1 any r-uniform hypergraph H with minimum vertex degree δ 1 (H) ≥ k−2 r−1 + r − 1 contains a Berge cycle on at least k vertices.If we ask for a Hamilton Berge cycle in an r-uniform hypergraph on n vertices, where r is fixed and n is large, then the bound n−2 r−1 + r − 1 is very weak since it differs from the maximum possible degree by n−2 r−2 − r + 1. Certainly, the two propositions below are folklore and should be known.
Proposition 2. Let r ≥ 3 and n ≥ r and let H be an r-uniform hypergraph on n vertices.If , then H contains a weak Hamilton cycle.
The proof is a one-line argument by replacing every edge of H with a clique on r vertices and applying the original theorem by Dirac.The bound on the minimum vertex degree is sharp.Indeed, for even n, the disjoint union of two copies of the complete r-uniform hypergraph K In any case, it follows from Propositions 2 and 3 that the resilience of the complete hypergraph 1) with respect to both weak and Berge Hamiltonicity.Recently, Coulson and Perarnau [8] improved the lower bound from Proposition 3 for sufficiently large n to the optimal 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).Poole [19] determined the threshold for the existence of a weak Hamilton cycle in H (r) (n, p).
Theorem 4 (Theorem 1.1 in [19]).Let r ≥ 3. Then , where c n is any function tending to c ∈ R and and ω( 1) is an arbitrary function that tends to infinity.
Since every Hamilton Berge cycle is in particular a weak Hamilton cycle, Theorem 4 yields that H (r) (n, p) a.a.s.does not contain a Hamilton Berge cycle if p ≤ (r−1)!ln n−ω (1)  n r−1 .Suprisingly, before our extended abstract [7] an upper bound on the threshold of H (r) (n, p) being Berge Hamiltonian hasn't been studied directly, but recently, Bal and Devlin [2] determined the threshold for Hamilton Berge cycles up to the constant factor.
Main result.In this paper we prove the following Dirac-type result for the existence of Hamilton Berge cycles in random hypergraphs.
Theorem 5.For every integer r ≥ 3 and every real γ > 0 the following holds asymptotically almost surely for H = H (r) (n, p) if p ≥ log 17r n n r−1 .Let H ⊆ H be a spanning subgraph with δ 1 (H) ≥ Then H contains a Hamilton Berge cycle.It is worth noting that it is not possible to merely reduce the problem of finding Berge cycles to a problem of finding a Hamilton cycle in the random graph to achieve the same resilience 1−2 1−r +o(1) in the random hypergraph H (r) (n, p).One possibility of such a 'reduction' would be to declare an edge uv ∈ [n]  2 to lie in G if {u, v} lies in some hyperedge of H (r) (n, p).Then such G behaves much like the random graph G(n, p ), where 1−p = (1−p) ( n−2 r−2 ) , i.e. p = Ω(polylog(n)/n).However, such a reduction leads to a resilience which is far from being the asymptotically optimal one, as asserted by our Theorem 5.
The minimum degree condition is asymptotically tight, meaning that we cannot replace it with chosen uniformly at random among all such partitions, it happens a.a.s.that, for i = 1, 2, the degree of every v ∈ V i into V i is at least Fixing a partition with that property, we find the hypergraph which does not contain a Berge Hamilton cycle and which satisfies δ 1 (H) ≥ 1 2 r−1 − γ p n r−1 .Furthermore, the bound on p is optimal up to possibly this polylogarithmic factor, and it provides an alternative proof of the result in [19] with only slightly weaker edge probability.
The proof is based on the absorbing method developed by Rödl, Ruciński, and Szemerédi [21].Of particular importance are the ideas from the proof of a Dirac-type result for random directed graphs due to Ferber, Nenadov, Noever, Peter and Škoric [11], which allow us to apply this method in such a very sparse scenario.
Organization of the paper.The rest of the paper is organised as follows.In Section 2 we state concentration inequalities that we are going to use.In Section 3 we introduce some technical definitions, the notion of (ε, p)-pseudorandom hypergraphs and prove some basic properties around these notions.In Section 4 we introduce the central concept of absorbers and in Section 5 we prove a connection lemma which will allow us to connect many pairs of vertices by disjoint paths.We provide in Section 6 first an outline of the proof of Theorem 5 and then we prove a technical theorem about Hamilton Berge cycles in pseudorandom hypergraphs which implies Theorem 5. We present the proof of Proposition 3 in Section 7.

Probabilistic tools: concentration inequalities
In our proofs we use the following standard bounds on deviations of random variables.Their proofs can be found in e.g.[14].The following two bounds belong to Chernoff's inequality, which collects different exponentially decreasing bounds on the tails of a binomial distribution.
Theorem 6 (Chernoff's inequality I).For every random variable X ∼ Bin(n, p) and every ε ≤ 3/2 we have The second Chernoff's inequality that we need provides only a bound on the upper tail of the binomial distribution.
Theorem 7 (Chernoff's inequality II).For every random variable X ∼ Bin(n, p) and every t ≥ 0 we have Finally we consider binomial random subsets.For Γ = [n] let Γ p1,...,pn be defined by including for every i ∈ [n] the i-th element of Γ with probability p i independently of all other elements of Γ.For each set S ⊆ 2 Γ of subsets of Γ and each set A ∈ S, we let X A denote the indicator variable for the event A ⊆ Γ p1,...,pn .Janson's inequality gives an exponentially small bound on the lower tail of the distribution of sums of such indicator variables.
Theorem 8 (Janson's inequality).Let Γ be a finite set and let S ⊆ 2 Γ be a set of subsets of Γ.If X = A∈S X A , where X A is an indicator variable, and

More definitions and auxiliary lemmas
Given an r-uniform hypergraph H, a subset U ⊆ V (H) and a vertex u ∈ V (H), we write deg H (u, U ) to denote the degree of u in U , which is the number of edges from H which contain u and which are contained completely in U ∪ {u}.For disjoint T and U , we write e H (T, U r−1 ) to denote the number of edges e from H with |e ∩ T | = 1 and |e ∩ U | = r − 1.The hypergraph H is sometimes omitted when it is clear from the context.
Our proof will use some central properties of the random hypergraph H (r) (n, p) which we call pseudorandom.So, our main theorem will state that r-uniform hypergraphs that are pseudorandom satisfy a Dirac-type theorem about Hamilton Berge cycles.
3.1.Pseudorandom hypergraphs.The following proposition asserts that for an edge probability p ≤ polylog(n)/n r−1 , the codegree of a random hypergraph doesn't get too large.Proposition 9.For every integer r ≥ 3, every real c > 0 and p ≤ ln c n n r−1 , with probability at least 1 − 1/n, the hypergraph H (r) (n, p) has maximum 2-collective degree at most 2 ln n.
Proof.The statement is an immediate consequence of Chernoff's inequality, Theorem 7, and the union bound over n 2 possible pairs of vertices.
Next we verify that the edges in the random hypergraph H (r) (n, p) are distributed as expected.
Lemma 10.For every integer r ≥ 3, reals ε, p > 0 and sufficiently large integer n the following holds with probability at least 1 − 2 n for any pair of disjoint subsets T and , then its expectation is clearly: Since there are at most n Lemma 11.For every integer r ≥ 3, reals ε, p > 0 with ε ∈ (0, 3/2) and sufficiently large integer n, the following holds with probability at least 1 − 2 n for any pair of disjoint subsets T and U with , then its expectation is clearly: . By Chernoff's inequality, Theorem 6, we have for fixed disjoint sets U and T with |T | ≥ ε|U | ≥ εm: Since there are at most n Lemmas 10 and 11 motivate the following definition of an (ε, p)-pseudorandom hypergraph.holds:

3.2.
A sampling lemma.We will repeatedly use the fact that in a hypergraph of high minimum degree, a random subset of vertices inherits high minimum degree of every vertex.More precisely, we prove the following.
Lemma 13.Let r ≥ 3, reals γ > 0, c > 0 and c > 2 + 2c be given.Let H = (V, E) be an r-uniform hypergraph on n vertices and V be a subset of V with at least 2m vertices, where m ≥ n ln c n .Furthermore assume that deg Then the following holds for all n sufficiently large.There exists a set U ⊂ V of size m such that Proof.We choose a set U randomly, by including every vertex u from V into U with probability q = m n independently, where we set n := |V |.Thus, we associate with every vertex u a Bernoulli variable t u with parameter q.
For a given vertex v ∈ V let X v be the random variable for deg H (v, U ). Clearly, we can write X v as the following sum of indicator random variables: where X A = u∈A t u and S = {e \ {v} : e ∈ E(H), v ∈ e}.
We are going to apply Theorem 8 and for this we put the following estimates: Then Theorem 8 yields 4r ln 1+2c n < n −3 .A similar argument applies also to V \ U .Taking union bound, with probability, say, at least 1 − 1 n the properties (i) and (ii) are satisfied by all vertices v ∈ V .On the other hand, πn .Therefore, with positive probability (at least (1 + o(1)) ) there exists a desired set U .
3.3.Matchings.Our building blocks for Hamilton cycles will consist of collections of edges between pairs of equal-sized sets, which we will refer to as (U 1 , U 2 )-matchings.Moreover, these edges will intersect both sets U 1 and U 2 in a clearly specified way.The following two definitions make these ideas precise.Definition 14 (An (i, j)-edge for (U 1 , U 2 )).Given an r-uniform hypergraph H = (V, E), two disjoint subsets U 1 , U 2 ⊆ V and an edge e ∈ E. We call e an (i, j)-edge for We call the vertices a i and b i the endpoints of the matching edge e i .
The next lemma asserts that between two disjoint subsets U 1 , U 2 of vertices of high 'minimum degree' and of size m = n/polylog(n) there must always be a (U 1 , U 2 )-matching M which intersects only U 1 and U 2 in the 'pattern' (1, r − 1) or (r − 1, 1).Its proof is an application of Hall's matching criterion under the exploitation of the properties of (ε, p)-pseudorandom hypergraphs.
Lemma 16.For every integer r ≥ 3, every real γ ∈ (0, 1) and c > 1 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H on n vertices with n sufficiently large and p ≥ ln cr n n r−1 .Let H ⊆ H be a subgraph of H and let Then there exists a (U 1 , U 2 )-matching in H.
For T ⊆ U 1 we define the neighbourhood N (T ) ⊆ U 2 as follows (and similarly one defines On the other hand, it follows from the (ε, p)-pseudorandomness property (i) of H, that , we obtain a contradiction in view of the choice of ε and the estimate Analogously to Lemma 16, one may prove almost verbatim the next lemma which asserts that between two disjoint subsets and with all vertices in U 1 having high 'minimum degree' there must always be a (U 1 , U 2 )-matching M consisting only of (1, r − 1)-edges for (U 1 , U 2 ).Lemma 17.For every integer r ≥ 3, every real γ ∈ (0, 1) and c ≥ 2 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H on n vertices with n sufficiently large and p ≥ ln cr n n r−1 .Let H ⊆ H be a subgraph of H and let The next technical definition is very handy to describe the basic structures we will be interested in.
Definition 18.Given an r-uniform hypergraph H and two disjoint sets A and B with |B| ≥ 2|A|.A 2-matching for (A, B) is a collection of pairs of edges (e a , f a ) a∈A so that (i) all these edges are distinct, (ii) a ∈ e a , a ∈ f a for all a ∈ A, (iii) there is an injection τ : ∪ a∈A {e a , f a } → B with τ (g) ∈ g, and (iv) for every edge g ∈ ∪ a∈A {e a , f a }: |g ∩ A| = 1 and |g ∩ B| = r − 1.
The next lemma allows us to find a 2-matching.
Lemma 19.For every integer r ≥ 3, every real γ ∈ (0, 2  Next we introduce the notion of an absorber.Definition 20 (Absorber for a vertex u).Given a (uniform) hypergraph H and a vertex u.An absorber for u is a subgraph A of H which consists of the following edges specified in the properties below: (i) A contains a Berge cycle C with u ∈ V * (C) of length 2t + 1 for some t ∈ N and with vertex sequence (u, v 1 , . . ., v t+1 , . . ., v 2t ); (ii) there are t − 1 Berge paths P 1 , . . ., P t−1 so that each path P i has endpoints v i+1 and v 2t+1−i and the inner vertex sets are pairwise disjoint; (iii) the edge-sets E(C), E(P 1 ),. . ., E(P t−1 ) are pairwise disjoint; We call the vertex u a reservoir vertex and the absorber A a u-absorber.The inner vertices of A are the vertices from V * (C) ∪ i V * (P i ).The vertices v 1 and v t+1 are referred to as the main endpoints of A.
The following proposition about an absorber for some vertex u explains its extreme usefullness in what comes and also the role of the main endpoints of an absorber -the absorber A u contains two Berge paths with the same endpoints and the inner vertices of the first path consist of all inner vertices of the absorber, while the inner vertices of the second contain all inner vertices but u.
Proposition 21.Let A be a u-absorber in some hypergraph H and let C and P 1 ,. . ., P t−1 be the Berge cycle and Berge paths of the absorber A respectively.Let (u, v 1 , . . ., v t+1 , . . ., v 2t ) be the sequence of C according to property (i) in Definition 20.Then A contains the following two Berge paths: (a) a Berge path Proof.We will construct (weak) paths P u and P as described above.Since the Berge paths P i and the cycle C in the absorber use different edges, it will imply that these weak paths are indeed Berge.
Let the structure of the cycle C be as follows: C = (u, e 1 , v 1 , e 2 , . . ., e t+1 , v t+1 , . . ., v 2t , e 2t+1 ).W.l.o.g.assume t is even (the case t odd is very similar).We construct P u as follows: Then the path P is defined as follows: It is most instructive to draw a picture: placing the inner vertices consecutively on a cycle and connecting appropriate vertices with the paths, one sees immediately that there is one way to traverse all vertices and a 'complementary' way to traverse all vertices except for u.

Connection lemma
In this section we will concentrate on a connection lemma that will allow us to put Berge paths together into a longer Berge path.

An expansion lemma.
The following lemma allows us to prove an expansion property for a pseudorandom hypergraph in a resilience setting between any two 'random', not too small vertex subsets.
Lemma 22.For every integer r ≥ 3, every real γ ∈ (0, 2 1−r ) and c > 1 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H with p ≥ ln cr n n r−1 .Let H ⊆ H be a subgraph of H and let U 1 , U 2 be disjoint subsets of V (H) with Then for every subset T 1 ⊆ U 1 of cardinality at least γm there exists a subset T 2 ⊆ U 2 of cardinality at least (1/2 + γ)m such that for every b ∈ T 2 there exists a (1, r − 1)-edge e for (T 1 , T 2 ) with b ∈ e.
Proof.We choose ε > 0 such that (1 + ε)( 12 + γ) r−1 < 2 1−r + 2γ.Let an (ε, p)-pseudorandom r-uniform hypergraph H and a subhypergraph H ⊆ H with sets U 1 , U 2 as specified in the assumption of the lemma be given.Without loss of generality let Then compare the lower bound e H (T r−1 ) which comes from condition (ii) of the definition of (ε, p)pseudorandomness (it is easily seen that |T 2 | ≥ 13(r−1)!ln n holds for n large enough): we however obtain a contradiction due to our choice of ε.Thus, T 2 must contain more than (1/2 + γ)m vertices.

A connection lemma.
Our goal is to prove a connection lemma, Lemma 25, which will allow us to connect a given collection of pairs of vertices by edge-disjoint Berge paths, all of whose inner vertices but possibly endpoints are pairwise disjoint as well.The lemma is similar to the connection lemma from [11].
First we argue that in a subgraph of a pseudorandom hypergraph there exists a Berge path between a sequence of disjoint, not so small sets, even after deleting a positive proportion of the vertices from each of the sets, if one has sufficiently high minimum vertex degree between every two 'consecutive' sets.
Lemma 23.For every integer r ≥ 3, every real γ ∈ (0, 2 1−r ) and c > 1 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H on n vertices with p ≥ ln cr n n r−1 and n sufficiently large.Let H ⊆ H be a subgraph of H and let there exists a vertex v 1 ∈ W 1 and a set T k ⊆ U k of cardinality at least (1/2 + γ)m with the following property: • for every v k ∈ T k there is a Berge path Proof.We choose ε > 0 so that Lemma 22 is applicable on input r, γ and c.First we show the following statement for all j = 2, . . ., k: ( ) there exists a subset T 1 ⊆ W 1 of cardinality max{1, γm/2 j−1 } and a subset T j ⊆ U j of cardinality at least (1/2 + γ)m such that for every v j ∈ T j there is a Berge path . The case j = 2 follows from Lemma 22 (all of whose assumptions are met): the Berge paths correspond to single edges with appropriate endpoints.
Let now j > 2 and proceed by induction.Then, we use the truth of statement ( ) for j − 1 and let T 1 and T j−1 be the corresponding sets.We have |T j−1 ∩ W j−1 | ≥ m/2.We partition T 1 into two equal-sized sets T 1 and T 1 (if |T 1 |=1 then we set T 1 := T 1 := T 1 ) and, by the ( )-property above, every vertex from T j−1 ∩ W j−1 is an endpoint of some Berge path starting in one of the sets T 1 , T 1 .Therefore, we find a subset and, additionally, the vertex v 1 is from T .Again, an application of Lemma 22 allows us to extend these Berge paths such that the subset T j ⊆ U j of all possible endpoints has cardinality at least (1/2 + γ)m.We also have Since log 2 (γm) ≤ log 2 m − r + 1 ≤ k the statement of the lemma follows.
We can now apply the above lemma iteratively, obtaining γm edge-disjoint Berge paths.The following corollary summarizes it in a 'symmetric' version.
Corollary 24.For every integer r ≥ 3, every real γ ∈ (0, 2 1−r ) and c > 1 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H on n vertices with p ≥ ln cr n n r−1 and n sufficiently large.Let H = (V, E) ⊆ H be a subgraph of H. Let U 1 , U 2 , . . ., U t , . . ., U t+t (for some t, t ≥ log 2 m) be pairwise disjoint subsets of V (H) each of cardinality m ≥ n ln c n .Further let A and B be two (not necessarily disjoint) sets of cardinality at least 3γm each, disjoint from the other sets U i .Assume moreover that the following conditions on the vertex degrees are satisfied Then for any ordering of A as a 1 , a 2 , . . .and B as b 1 , b 2 ,. . ., there exists a system of pairwise edge-disjoint Berge paths P 1 , . . ., P γm such that (a) there exists a (γm)-set I = {i 1 , . . ., i γm } so that the endpoints of P j are a ij and b ij for every j ∈ [γm] and the edges lie completely within (∪ s U s ) ∪ {a ij , b ij }, (b) every vertex in (∪ s U s ) is an inner vertex of at most one of the paths P j , (c) every path P j has exactly one inner vertex from each of the sets A, B, U 1 , . . ., U t+t .
Proof.We choose ε > 0 so that Lemma 23 is applicable on input r, γ and c.We will apply now Lemma 23 to find at least γm Berge paths P i as described in (a)-(c).
Assume that we already found some paths P 1 ,. . ., P s (s < γm), and let D 1 , . . ., D t+t be the sets of inner vertices of theses paths contained in the sets U 1 , . . ., U t+t .To construct a new Berge path, we apply Lemma 23 twice: to some γm-subset W 0 of A \ {a ij : j ∈ [s]} and the sets ) and to some γm-subset W t+t +1 of B \ {b ij : j ∈ [s]} and the sets ).This yields vertices v 0 ∈ W 0 and v t+t +1 ∈ W t+t +1 and sets T t ⊆ U t and T t ⊆ U t , each of size at least (1/2 + γ)m so that for every v t ∈ T t there exists a Berge path that starts in v 0 and ends in v t and the inner vertices of which avoid already used vertices from the sets D i , and such that for every v t ∈ T t there exists a Berge path with similar properties ending in v t+t +1 .We may assume that v 0 = a j and v t+t +1 = b j for some j, not previously used, since we can apply Lemma 22 to any γm-subsets W 0 , W t+t +1 of A and B and thus less than γm vertices of A and of B will fail to serve as a 'starting vertex'.
Since |T t ∩ T t | ≥ 2γm and as we used less than γm vertices from each of these sets for the inner vertices of the Berge paths P 1 ,. . ., P s , we finally obtain a Berge path P j connecting a j and b j as required for the properties (a)-(c).Iterating this procedure yields the desired system of γm Berge paths.
Next we show how iterating the above corollary will allow us to connect a i with b i for every i.
Lemma 25 (Connecting lemma).For every integer r ≥ 3, every real γ ∈ (0, 2 1−r ) and c > 7 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H on n vertices with p ≥ ln cr n n r−1 , ∆ 2 (H) ≤ 2 ln n and n sufficiently large.Let H = (V, E) ⊆ H be a subgraph of H, let A = {a 1 , . . ., a m }, B = {b 1 , . . ., b m } and U be subsets of V with r−1 for every u ∈ A ∪ B ∪ U , Then there exists a system of pairwise edge-disjoint Berge paths P 1 , . . ., P m such that (a) the endpoints of P i are a i and b i for every i ∈ [m] and the edges lie completely within U ∪ {a i , b i } (if a i = b i we abuse notation still calling P i a Berge path, although it is actually a Berge cycle), (b) every vertex in U is an inner vertex of at most one of the paths P i , (c) the length of each Berge path P i is between 2 log 2 m + 1 and 4 log 2 m + 2, and all lengths may be chosen to be even or odd at the same time.
Proof.We choose ε > 0 so that Corollary 24 is applicable on input r, γ and c.Notice that we may then apply Lemma 13 on input r, γ, c = 2.5 and c.
The proof strategy will proceed in rounds.In each round we will connect half of the yet not connected pairs (a i , b i ).It is clear, that after log 2 m rounds the process will terminate.Next we turn to the technical details.We describe the first two rounds and it will become clear how we proceed in the remaining rounds.We assume that all paths should have odd length (as the case of even length is treated similarly, by choosing an additional set U 2 log 2 m+1 of size m in every round).
We come to the first round.We use Lemma 13 to consecutively choose pairwise disjoint subsets U 1 , . . ., U 2 log 2 m of size m of the set U such that the following holds (throughout the proof, the parameter = O(log 2  2 m) is the number of subsets of size m or 2m that we chose from U so far): It is clear, that Corollary 24 is applicable.By performing this step 1/(2γ) times, i.e. by choosing each time new 2 log 2 m pairwise disjoint sets with the property above, we can connect half of the pairs (a i , b i ) by desired Berge paths.Observe that in this first round we sampled (with Lemma 13) at most (2/γ) log 2 m many pairwise disjoint m-subsets of U .We delete the vertices of the sampled sets from U , but use the same notation for simplicity.This finishes the first round.
We move next to the second round.Let I be an m/2-set of indices of pairs (a i , b i ) which haven't been yet connected.We still denote the vertices {a i : i ∈ I} by A and similarly for B. We apply Lemma 13 to choose two disjoint subsets A 1 and B 1 of U , each of cardinality 2m such that and Then Lemma 19 asserts the existence of 2-matchings (e a , f a ) a∈A and (e b , f b ) b∈B for (A, A 1 ), for (B, B 1 ) respectively.Let τ A and τ B be the injections for these 2-matchings, cf.Definition 18. Next we order the vertices of A according to the index set I = {i 1 , . . ., i m/2 } as follows: τ A (e ai 1 ), τ A (f ai 1 ), τ A (e ai 2 ), τ A (f ai 2 ),. . ., τ A (e ai m/2 ), τ A (f ai m/2 ).Exactly in the same way we order the vertices of B. We are now back in the original situation: exactly as in the first round we sample at most (2/γ) log 2 m many pairwise disjoint m-subsets of U , and thus, we find a system of m/2 Berge paths P 1 , . . ., P m/2 between the sets A 1 and B 1 .Out of m/2 Berge paths we find at least m/4 so that no two of them have endpoints of the form τ A (e ai j ), τ A (f ai j ) or τ B (e bi s ), τ B (f bi s ) for some j or s respectively.
Recall, that we have 2-matchings for (A, A 1 ) and for (B, B 1 ).Thus, using these we extend the m/4 Berge paths to m/4 Berge paths between A and B that satisfy properties (a) and (b) of the lemma.Observe that in this second round we sampled (with Lemma 13) disjoint subsets of U the union of which contains at most ( 2 γ )m log 2 m + 4m < ( 3 γ )m log 2 m vertices.There remain m/4 vertices of A and B to be matched, and the corresponding m/2 vertices of A 1 and B 1 , which are connected by 2-matchings respectively.We proceed in a similar way in the next rounds by finding 2-matchings between appropriate sets, finding m/2 Berge paths and then identifying m/2 i additional Berge paths in the ith round.After log 2 m rounds we find the desired system of m Berge paths by using at most (3/γ)m log 2 2 m vertices.This finishes the proof.
6. Proof of Theorem 5 6.1.Proof outline.We explain the idea of the proof for weak Hamilton cycles and not to worry about the Berge property.Given a spanning subhypergraph H ⊆ H ∼ H (r) (n, p) as in the statement of the theorem, we partition the vertex set of H into disjoint sets Y , Z and W , where 1) n and W contains almost all vertices of H.The set Z assumes the role of a reservoir.Choosing a partition with such sizes uniformly at random guarantees that with positive probability for every vertex v the edges incident to v are distributed as expected into the sets Y , Z and W (cf. Lemma 13).Also, since H is a subgraph of the random hypergraph, we have good control on the edge distribution among various subsets of vertices (cf.Lemmas 10 and 11).
Next we construct a weak path Q with V * (Q) ⊆ Y such that for every subset M ⊆ Z there exists a weak path Q M that has the same endpoints as Q and such that V * (Q M ) = V * (Q) ∪M (we will use Lemma 25 to construct absorbers as described by Proposition 21 and to connect them into the path Q).This property (absorbing property) will be crucial at a later stage of the argument.
Then we partition W randomly into log O (1) n sets and distribute Y \ V * (Q) among them such that all of these sets have the same size o(n/ log O(1) n).Informally speaking, since |Y | is significantly smaller than |W | and every vertex from Y is "well-connected" to W , such partition In the second stage we need to connect the corresponding pairs of vertices on each of the Berge cycles C u , where u ∈ Z, as specified in the property (ii) from the definition of the asorbers, Definition 20.Observe that there are at most 2 log 2 |Z| − 1 such pairs for each absorber, which requires connecting in total at most 2|Z| log 2 |Z| pairs.We apply Lemma 13 to the set Y \ U 1 and obtain a set U 2 of cardinality 6 γ |Z| log 3 2 n such that Again, an application of the connecting lemma, Lemma 25, yields the system of Berge paths, that completes for each u ∈ Z an absorber A u with the required properties.Finally, in the third stage, we put all our absorbers onto a Berge path.More precisely, we aim to connect the paths of all A u s as specified in Proposition 21 (a) into a Berge path.We consider the main endpoints u i and u i of every u-absorber and we wish to connect u i with u i+1 for every i ∈ [|Z| − 1] by edge disjoint Berge paths (whose inner vertex sets are pairwise disjoint as well), using again the connection lemma, Lemma 25.Recall, that by our choice of Y , we have for all v ∈ V .Therefore, all assumptions of Lemma 25 are met, and we obtain thus a system of Berge paths that connects the required pairs of endpoints of the absorbers A u (u ∈ Z) into the absorbing Berge path P A .Observe that V * (P A ) ⊆ Z ∪ Y , the endpoints of P A are u 1 and u |Z| and the path P A has the following absorbing property (by Proposition 21): • for every subset Z ⊆ Z, there exists a Berge path P Z with the same endpoints as P A and V * (P Z ) = V * (P A ) \ Z .
We will later use some vertices from Z for further connections that come and we denote by Y the vertices of Y which are neither inner vertices of P A .
Partitioning W .As a next step we partition W into log c2 2 n sets W 1 , . . ., W i of the same cardinality plus a remainig set M of fewer than n/ log c2 2 n vertices.We do so by consecutively applying Lemma 13, so that the sets W i will satisfy the following properties: • deg(v, W i ) ≥ (2 1−r + 3γ )p |Wi| r−1 for all v ∈ V .Next we distribute the vertices from Y equally among the sets W i 's (but we still use the same notation for these new sets) and put the at most log c2 2 n vertices to M .Observe that then still deg(v, W i ) ≥ (2 1−r + 2γ )p |Wi| r−1 for all v ∈ V holds, by the choice of c 1 , c 2 and the sizes of Y and W . Covering W with Berge paths.Now we apply Lemma 16 to obtain (W i , W i+1 )-matchings in H for i = 1, . . ., log c2 2 n.Notice that this gives rise to a system of (1 − o(1))n/ log c2 2 n edge-disjoint Berge paths, each of length log c2 2 n, so that the inner vertices of these paths are pairwise disjoint and form a partition of W \ M .To obtain a particular path, one starts with some vertex w 1 ∈ W 1 , then follows the matching edge e 1 w 1 , then considers the second endpoint w 2 ∈ e 1 , then follows the matching edge e 2 w 2 from the (W 2 , W 3 )-matching in H and so on.
Additionally, we also view every single vertex w ∈ M as a Berge path.Thus, in total we cover W ∪ Y by t Berge paths P 1 , . . ., P t , where t is less than 2(n/ log c2 2 n) + log c2 2 n.
Obtaining a weak Hamilton cycle in H. Recall, that |Z| = n log c 1 2 n and deg(v, Z) ≥ (2 1−r + 3γ )p |Z| r−1 for all v ∈ V holds.Thus, the assumptions of the connecting lemma, Lemma 25, are met.Therefore we are able to connect the Berge paths P 1 , . . ., P t and the absorbing Berge path P A into some 'almost' cycle C by using the vertices of some subset Z from Z.By the absorbing property, we may delete the vertices from Z and restructure the path P A (which is a subgraph of C ) into P so that the so obtained cycle C is indeed a weak Hamilton cycle.Why is C already a Hamilton Berge cycle in H.The cycle which we constructed in the way above is indeed Berge.The reason is that we build our cycle by constructing Berge paths between partite sets (cf.Lemmas 16,17 and 25) and in doing so we use only edges e between some two sets U i and U i+1 which lie within U i ∪ U i+1 such that |e ∩ U i | ∈ {1, r − 1}.In this way we guarantee that at any stage of our construction we are using genuinely new edges.Thus, the constructed cycle is indeed Berge.

Berge Hamiltonicity in dense hypergraphs
In this section we prove Proposition 3. The asymptotic tightness of the bound on the minimum vertex degree was considered already in the introduction.We remark that optimal bound was proven in a long paper in [8], whereas the proof below is elementary and very short. .Since P is a longest Berge path, it holds for every e ∈ E (v 1 ) that e ⊆ V * (P ).The same is true for v k .
We claim that there exist distinct hyperedges e ∈ E (v 1 ) and e ∈ E (v k ) as well as an index i ∈ [k − 1] such that v i+1 ∈ e ∩ V * (P ) and v i ∈ e ∩ V * (P ).Assume for a contradiction that this is not true.Then, by the pigeonhole principle, there exists a subset S ⊆ [k − 1] such that |S| ≤ (k −1)/2 with f ⊆ {v i+1 : i ∈ S}∪{v 1 } for every f ∈ E (v 1 ) or with f ⊆ {v i : i ∈ S}∪{v k } for every f ∈ E (v k ).Suppose that f ⊆ {v i+1 : i ∈ S} ∪ {v 1 } for every f ∈ E (v 1 ) holds.Then + n − 1, which is a contradiction.Hence, there exist e ∈ E (v 1 ) and e ∈ E (v k ) with the claimed property.Let C = (v 1 , e, v i+1 , e i+1 , v i+2 , . . ., v k , e , v i , e i−1 , . . ., e 1 ) be the Berge cycle that can be constructed from P using e and e .If k = n, then C is a Hamilton Berge cycle and we are done.Otherwise we get a contradiction, similar as in Dirac's original proof, by breaking up the cycle C and extending it by a new edge (since H is connected), thus obtaining a longer Berge path.

2 Proposition 3 . 1 r− 1 +
vertices has minimum vertex degree n/2−1 r−1 but is disconnected.For odd n, the hypergraph H on n vertices that is the composition of two copies of K (r) n 2 that share one vertex satisfiesδ 1 (H) = n/2 −1 r−1but does not contain a weak Hamilton cycle.The following result can be obtained along the lines of the proof of Dirac's theorem for graphs.Let r ≥ 3 and let H be an r-uniform hypergraph on n > 2r − 2 vertices.If δ 1 (H) ≥ n/2 −n − 1 then H contains a Hamilton Berge cycle.
(en/|U |) 2|U | pairs (T, U ) of fixed sizes |T | and |U | we use union bound to obtain that with probability at least 1 − ii) for any pair of disjoint subsets T and U with ε|U | ≤ |T | ≤ |U | ≤ n/2 and |U | ≥ 13(r−1)!ln n ε 3 p 1/(r−1) It will be sufficient to verify |N (T )| ≥ |T | for sets T ⊆ U i (Hall's condition) with |T | ≤ m/2 where i ∈ [2].Assume w.l.o.g. that T ⊆ U 1 and further suppose towards a contradiction that |N (T )| < |T | ≤ m/2 .Then, by the assumptions of the lemma, we have e

Proof of Proposition 3 . 1 r− 1 + n − 1 .
Let r ≥ 3 and let H = (V, E) be an r-uniform hypergraph on n > 2r − 2 vertices with δ 1 (H) ≥ n/2 −We observe first that due to the large minimum vertex degree, H is connected.Let P = (v 1 , e 1 , v 2 , . . ., e k−1 , v k ) be a longest Berge path in H.For every v ∈ V we defineE (v) = e ∈ E \{e 1 , . . ., e k−1 } : v ∈ e .The condition on the minimum vertex degree implies that we have |E (v 1 )|, |E (v k )| ≥ n/2 −1 r−1 Definition 12 ((ε, p)-pseudorandomness).Given p > 0 and ε ∈ (0, 3/2), a hypergraph H on n vertices is (ε, p)-pseudorandom if it satisfies the following properties:(i) for any pair of disjoint subsets T and U of [n] with |U | ≤ |T | holds: 1−r ) and c > 2 there exists an ε > 0 such that the following holds for any (ε, p)-pseudorandom r-uniform hypergraph H on n vertices with p ≥ ln cr n n r−1 and n sufficiently large with ∆ 2 (H) ≤ 2 ln n.Let H ⊆ H be a subgraph of H and let A and B be disjoint subsets of V (H) with |A| = m and |B| ≥ 4m, where m ≥ n ln c n , and such that deg H (a, B) ≥ 1 2 r−1 + 2.5γ p |B| r−1 for every a ∈ A. Then there exists a 2-matching for (A, B).Proof.We apply Lemma 13 to B and obtain an equipartition into B 1 ∪B 2 such that deg H (a, B i ) ≥ 1 2 r−1 + 2γ p |Bi| r−1 for every a ∈ A and i ∈ [2].An application of Lemma 17 to (A, B 1 ) and (A, B 2 ) yields the desired 2-matching.