Partitioning random graphs into large cycles

DOI10.1016/0012-365X(88)90089-1zbMath0647.05050WikidataQ57401619 ScholiaQ57401619MaRDI QIDQ1104340

Alan M. Frieze

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphHamilton cyclelimiting probability distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Zero-one laws (60F20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Almost all regular graphs are Hamiltonian
• 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
• Finding Hamilton cycles in sparse random graphs
• On large matchings and cycles in sparse random graphs
• Hamiltonian circuits in random graphs
• On the existence of Hamiltonian cycles in a class of random graphs
• On the strength of connectedness of a random graph
• On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
• Onk-leaf connectivity of a random graph
• Clutter percolation and random graphs