Hamilton cycles in the line graph of a random hypergraph

DOI10.37236/11365MaRDI QIDQ6499979

Katarzyna Rybarczyk

Publication date: 10 May 2024

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• \(k\)-connectivity of uniform \(s\)-intersection graphs
• The coupling method for inhomogeneous random intersection graphs.
• Loose Hamilton cycles in random uniform hypergraphs
• A note on hamiltonicity of uniform random intersection graphs
• On the independence number and Hamiltonicity of uniform random intersection graphs
• Sharp thresholds for Hamiltonicity in random intersection graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamiltonian circuits in random graphs
• Hamilton cycles in the line graph of a random graph
• Spanning structures and universality in sparse hypergraphs
• Tight Hamilton cycles in random uniform hypergraphs
• Hamiltonian Berge cycles in random hypergraphs
• A Guided Tour in Random Intersection Graphs

This page was built for publication: Hamilton cycles in the line graph of a random hypergraph