Hamiltonian decompositions of random bipartite regular graphs.

DOI10.1016/j.jctb.2003.07.001zbMath1033.05082OpenAlexW1999192582MaRDI QIDQ1426097

Catherine Greenhill, Nicholas C. Wormald, Jeong Han Kim

Publication date: 14 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.07.001

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Recent advances on the Hamiltonian problem: survey III, Locally quasiconvex small-cancellation groups, Minimal selectors and fault tolerant networks, Star graph automorphisms and disjoint Hamilton cycles

Cites Work

• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Differential equations for random processes and random graphs
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item