Hamiltonian decompositions of random bipartite regular graphs.

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

Jeong Han Kim, Catherine Greenhill, Nicholas C. Wormald

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

05C80: Random graphs (graph-theoretic aspects)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C45: Eulerian and Hamiltonian graphs

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

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

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