Loose Hamilton cycles in random 3-uniform hypergraphs

zbMATH Open1189.05117arXiv1003.5817MaRDI QIDQ976682FDOQ976682

Authors: Alan Frieze 

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1003.5817

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Loose Hamilton cycles in random uniform hypergraphs
• Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
• Packing loose Hamilton cycles
• Loose Hamilton Cycles in Regular Hypergraphs
• Loose Hamilton cycles in hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Cited In (30)

• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Spanning structures and universality in sparse hypergraphs
• Recent advances on the Hamiltonian problem: survey III
• Acquaintance time of random graphs near connectivity threshold
• Hamiltonian cycles on a random three-coordinate lattice
• A note on spanning \(K_r\)-cycles in random graphs
• Transference for loose Hamilton cycles in random 3-uniform hypergraphs
• Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
• Tight Hamilton cycles in random uniform hypergraphs
• On rainbow Hamilton cycles in random hypergraphs
• Rainbow Hamilton cycles in random graphs
• Tight Hamilton cycles in random hypergraphs
• On spanning structures in random hypergraphs
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• Loose Hamilton cycles in random uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Hamilton saturated hypergraphs of essentially minimum size
• Loose Hamilton Cycles in Regular Hypergraphs
• Rainbow matchings and Hamilton cycles in random graphs
• Finding tight Hamilton cycles in random hypergraphs faster
• Title not available (Why is that?)
• Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
• Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
• On offset Hamilton cycles in random hypergraphs
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Packing Loose Hamilton Cycles
• Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
• Loose cores and cycles in random hypergraphs
• Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues

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)