For How Many Edges is a Digraph Almost Certainly Hamiltonian?

DOI10.2307/2039100MaRDI QIDQ3214952zbMATH OpenOpenAlexFDO

Authors Edward Maitland Wright

Publication date 1973

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

Mathematics Subject Classification ID

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

Cites work

• Asymptotics in Random (0, 1)-Matrices

Cited in

(6)

• How many ways can a permutation be factored into two n-cycles?
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A Logarithmic Connection for Circular Permutation Enumeration
• Large cycles in large labelled graphs
• Packing, counting and covering Hamilton cycles in random directed graphs
• Interaction graphs of isomorphic automata networks. II: Universal dynamics

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

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