For How Many Edges is a Graph Almost Certainly Hamiltonian?

DOI10.1112/JLMS/S2-8.1.44zbMATH Open0277.05126OpenAlexW1966916214MaRDI QIDQ4401974FDOQ4401974

Authors: Edward Maitland Wright 

Publication date: 1974

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-8.1.44

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (5)

• The hidden algorithm of Ore's theorem on Hamiltonian cycles
• The number of sparsely edged labelled Hamiltonian graphs
• The number of Hamiltonian circuits in large, heavily edged graphs
• Almost all regular graphs are Hamiltonian
• Large cycles in large labelled graphs

This page was built for publication: For How Many Edges is a Graph Almost Certainly Hamiltonian?

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