Hamiltonian circuits in random graphs

1976/01/01 by L. Pósa · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory

paper · doi:10.1016/0012-365x(76)90068-6

crossref issued 1976/01/01 · crossref published 1976/01/01 · crossref published-print 1976/01/01 · openalex publication_date 1976/01/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/13 · openalex updated_date 2026/07/14

Cited by

• Average-case analysis of algorithms for matchings and related problems
• Limit distribution for the existence of hamiltonian cycles in a random graph
• Introduction to Random Graphs
• On Size Ramsey Number of Paths, Trees and Circuits. II
• Cycle lengths in sparse graphs
• The Hidden Algorithm of Ore's Theorem on Hamiltonian Cycles
• Lajos Pósa (mathematician) [wikipedia]