On the Hamiltonicity of random bipartite graphs

DOI10.1007/S13226-015-0119-6MaRDI QIDQ2628103zbMATH OpenOpenAlexFDO

Authors 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 graphDirac's theoremHamiltonicityrandom graph

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian decompositions of random bipartite regular graphs.
• Hamiltonicity in randomly perturbed hypergraphs
• On Hamiltonian bipartite graphs
• On the number of hamilton cycles in a random graph
• On Hamiltonicity of uniform random intersection graphs
• scientific article; zbMATH DE number 4114681
• scientific article; zbMATH DE number 3950585
• Hamiltonicity of graphs perturbed by a random regular graph
• scientific article; zbMATH DE number 4087714

Cites work

• Concentration Inequalities and Martingale Inequalities: A Survey
• Dirac's theorem for random graphs
• Hamiltonian circuits in random graphs
• Hamiltonian cycles in random regular graphs
• How many random edges make a dense graph hamiltonian?
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• Local resilience of graphs
• On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs
• On two Hamilton cycle problems in random graphs
• Random graphs.
• Reducibility among combinatorial problems
• Resilient pancyclicity of random and pseudorandom graphs
• Sharp thresholds for Hamiltonicity in random intersection graphs
• Some Theorems on Abstract Graphs
• Sparse pseudo‐random graphs are Hamiltonian

Cited in

(11)

• Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
• Hamiltonian decompositions of random bipartite regular graphs.
• An FPTAS for the hardcore model on random regular bipartite graphs
• On Hamiltonicity of uniform random intersection graphs
• scientific article; zbMATH DE number 19173 (Why is no real title available?)
• Hamilton cycles, minimum degree, and bipartite holes
• The pizza-cutter's problem and Hamiltonian paths
• Cycles in random bipartite graphs
• Hamilton cycles in random lifts of graphs
• Long paths in heterogeneous random subgraphs of graphs with large minimum degree
• Several graph properties in terms of the multiplicative version of the first Zagreb index

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

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