Loose Hamilton cycles in random 3-uniform hypergraphs
From MaRDI portal
Publication:976682
Abstract: In the random hypergraph H=H(n,p;3) each possible triple appears independently with probability p. A loose Hamilton cycle can be described as a sequence of edges {x_i,y_i,x_{i+1}} for i=1,2,...,n/2. We prove that there exists an absolute constant K>0 such that if p>Klog n/n^2 then lim_{n->oo 4 |n}}Pr(H(n,p;3) contains a loose Hamilton cycle)=1.
Recommendations
Cited in
(32)- Packing loose Hamilton cycles
- Loose cores and cycles in random hypergraphs
- Spanning structures and universality in sparse hypergraphs
- Recent advances on the Hamiltonian problem: survey III
- Hamilton cycles in quasirandom hypergraphs
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
- Tight Hamilton cycles in random uniform hypergraphs
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Acquaintance time of random graphs near connectivity threshold
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Loose Hamilton cycles in random uniform hypergraphs
- Rainbow matchings and Hamilton cycles in random graphs
- Loose Hamilton Cycles in Regular Hypergraphs
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
- On rainbow Hamilton cycles in random hypergraphs
- Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
- Tight Hamilton cycles in random hypergraphs
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Hamilton saturated hypergraphs of essentially minimum size
- Hamiltonian cycles on a random three-coordinate lattice
- A note on spanning \(K_r\)-cycles in random graphs
- On spanning structures in random hypergraphs
- scientific article; zbMATH DE number 7448677 (Why is no real title available?)
- Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
- Finding tight Hamilton cycles in random hypergraphs faster
- On offset Hamilton cycles in random hypergraphs
- Rainbow Hamilton cycles in random graphs
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
This page was built for publication: Loose Hamilton cycles in random 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976682)
