Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity

DOI10.1016/J.JCTB.2016.09.003MaRDI QIDQ345119zbMATH OpenOpenAlexWikidataFDO

Authors Andrzej Ruciński, M. Şileikis, Andrzej Dudek, Alan Frieze

Publication date 25 November 2016

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Hamilton cyclerandom regular graphrandom hypergraphmonotone graph property

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Abstract: We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $kge2$) on $n$ labeled vertices: $mathbb{G}^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $mathbb{R}^{(k)}(n,d)$, the random $d$-regular $k$-graph. We show that if $nlognllmll{n}^k$ we can choose $d=d(n)simkm/n$ and couple $mathbb{G}^{(k)}(n,m)$ and $mathbb{R}^{(k)}(n,d)$ so that the latter contains the former with probability tending to one as $noinfty$. This extends an earlier result of Kim and Vu about "sandwiching random graphs". In view of known threshold theorems on the existence of different types of Hamilton cycles in $mathbb{G}^{(k)}(n,m)$, our result allows us to find conditions under which $mathbb{R}^{(k)}(n,d)$ is Hamiltonian. In particular, for $kge3$ we conclude that if $n^{k-2}lldll{n}^{k-1}$, then a.a.s. $mathbb{R}^{(k)}(n,d)$ contains a tight Hamilton cycle.

Recommendations

• Loose Hamilton Cycles in Regular Hypergraphs
• Regular hypergraphs: asymptotic counting and loose Hamilton cycles
• Tight Hamilton cycles in random uniform hypergraphs
• Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
• Tight Hamilton cycles in random hypergraphs

Cites work

• scientific article; zbMATH DE number 3906527 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Almost all regular graphs are hamiltonian
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Generating Random Regular Graphs Quickly
• Generating random regular graphs
• Introduction to Random Graphs
• It's a small world for random surfers
• Loose Hamilton Cycles in Regular Hypergraphs
• Loose Hamilton cycles in random 3-uniform hypergraphs
• Loose Hamilton cycles in random uniform hypergraphs
• Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Random graphs.
• Random regular graphs of high degree
• Sandwiching random graphs: universality between random graph models
• Tight Hamilton cycles in random hypergraphs
• Tight Hamilton cycles in random uniform hypergraphs

Cited in

(10)

• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
• Edge correlations in Random regular hypergraphs and applications to subgraph testing
• Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
• Sandwiching biregular random graphs
• On some multicolor Ramsey properties of random graphs
• The number of perfect matchings, and the nesting properties, of random regular graphs
• Rainbow connection of random regular graphs
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• Sandwiching dense random regular graphs between binomial random graphs
• The average distance and the diameter of dense random regular graphs

This page was built for publication: Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345119)