Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
From MaRDI portal
Publication:345119
DOI10.1016/j.jctb.2016.09.003zbMath1350.05110arXiv1508.06677OpenAlexW3098804474WikidataQ57401402 ScholiaQ57401402MaRDI QIDQ345119
Andrzej Ruciński, Matas Šileikis, Andrzej Dudek, Alan M. 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
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Sandwiching biregular random graphs, Rainbow Connection of Random Regular Graphs, The number of perfect matchings, and the nesting properties, of random regular graphs, On some Multicolor Ramsey Properties of Random Graphs, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, The average distance and the diameter of dense random regular graphs, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Sandwiching dense random regular graphs between binomial random graphs, Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
- It's a small world for random surfers
- Loose Hamilton cycles in random uniform hypergraphs
- Loose Hamilton cycles in random 3-uniform hypergraphs
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Sandwiching random graphs: universality between random graph models
- Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
- Random regular graphs of high degree
- Introduction to Random Graphs
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- Almost all regular graphs are hamiltonian
- Generating Random Regular Graphs Quickly
- Tight Hamilton cycles in random uniform hypergraphs
- Tight Hamilton cycles in random hypergraphs
- Loose Hamilton Cycles in Regular Hypergraphs
- Generating random regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
