For How Many Edges is a Digraph Almost Certainly Hamiltonian?

DOI10.2307/2039100zbMath0272.05112OpenAlexW4255102326MaRDI QIDQ3214952

E. M. Wright

Publication date: 1973

Full work available at URL: https://doi.org/10.2307/2039100

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

How many ways can a permutation be factored into two n-cycles? ⋮ Fast probabilistic algorithms for Hamiltonian circuits and matchings ⋮ Large cycles in large labelled graphs ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ A Logarithmic Connection for Circular Permutation Enumeration

Cites Work

• Asymptotics in Random (0, 1)-Matrices

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