On the Hamiltonicity of random bipartite graphs

DOI10.1007/s13226-015-0119-6zbMath1364.05066OpenAlexW1982503413MaRDI QIDQ2628103

Yilun Shang

Publication date: 12 June 2017

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-015-0119-6

zbMATH Keywords

bipartite graphHamiltonicityrandom graphDirac's theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

The Pizza-Cutter’s Problem and Hamiltonian Paths ⋮ Long paths in heterogeneous random subgraphs of graphs with large minimum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp thresholds for Hamiltonicity in random intersection graphs
• On two Hamilton cycle problems in random graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamiltonian cycles in random regular graphs
• Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
• Hamiltonian circuits in random graphs
• Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• Dirac's theorem for random graphs
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• Concentration Inequalities and Martingale Inequalities: A Survey
• Local resilience of graphs
• Sparse pseudo‐random graphs are Hamiltonian
• How many random edges make a dense graph hamiltonian?
• Reducibility among Combinatorial Problems
• Some Theorems on Abstract Graphs

This page was built for publication: On the Hamiltonicity of random bipartite graphs