Hamilton cycles in a class of random directed graphs

DOI10.1006/jctb.1994.1060zbMath0813.05058DBLPjournals/jct/CooperF94OpenAlexW2007501353WikidataQ57401577 ScholiaQ57401577MaRDI QIDQ1333332

Alan M. Frieze, Colin Cooper

Publication date: 13 September 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b4d411d754d83212977f24eabfc12bfd556ddfb8

zbMATH Keywords

thresholdsdigraphHamiltonian cyclerandom graphrandom digraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ Getting a Directed Hamilton Cycle Two Times Faster ⋮ Perfect fractional matchings in \(k\)-out hypergraphs ⋮ Finding Hamilton cycles in random graphs with few queries ⋮ A scaling limit for the length of the longest cycle in a sparse random digraph ⋮ On the existence of Hamilton cycles with a periodic pattern in a random digraph ⋮ Unnamed Item ⋮ Hamilton cycles in the union of random permutations

This page was built for publication: Hamilton cycles in a class of random directed graphs