A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
From MaRDI portal
Publication:1985454
DOI10.1016/j.jctb.2019.11.001zbMath1437.05124arXiv1611.09423OpenAlexW2989075038MaRDI QIDQ1985454
Mikhail Isaev, Reshma Ramadurai, Catherine Greenhill, Daniel Altman
Publication date: 7 April 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.09423
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)
Related Items
Spanning trees in random regular uniform hypergraphs, Hamiltonicity of graphs perturbed by a random regular graph, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
- Approximate counting of regular hypergraphs
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Complex martingales and asymptotic enumeration
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Generating and Counting Hamilton Cycles in Random Regular Graphs
- On the Number of Perfect Matchings in Random Lifts
- Tight Hamilton cycles in random uniform hypergraphs
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
- Tight Hamilton cycles in random hypergraphs
- Loose Hamilton Cycles in Regular Hypergraphs
