Hamilton cycles in a class of random directed graphs

DOI10.1006/JCTB.1994.1060zbMATH Open0813.05058DBLPjournals/jct/CooperF94OpenAlexW2007501353WikidataQ57401577 ScholiaQ57401577MaRDI QIDQ1333332FDOQ1333332

Authors: Colin Cooper, Alan Frieze 

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

Recommendations

• scientific article; zbMATH DE number 1496581
• scientific article; zbMATH DE number 17675
• Packing, counting and covering Hamilton cycles in random directed graphs
• On the existence of Hamilton cycles with a periodic pattern in a random digraph

zbMATH Keywords

random graphHamiltonian cyclethresholdsdigraphrandom digraph

Mathematics Subject Classification ID

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

Cited In (28)

• Elegantly colored paths and cycles in edge colored random graphs
• Random directed graphs are robustly Hamiltonian
• Title not available (Why is that?)
• On the existence of Hamilton cycles with a periodic pattern in a random digraph
• A scaling limit for the length of the longest cycle in a sparse random digraph
• Hamilton Cycles in Random Lifts of Directed Graphs
• Title not available (Why is that?)
• Getting a directed Hamilton cycle two times faster
• Finding Hamilton cycles in random graphs with few queries
• Title not available (Why is that?)
• Hamilton cycles in the semi-random graph process
• Hamilton cycles in 3-out
• Six Ways of Looking at Burtin's Lemma
• How many random edges make a dense graph hamiltonian?
• Counting Hamilton cycles in sparse random directed graphs
• Spanning cycles in random directed graphs
• Walks on random digraphs
• Hamilton cycles containing randomly selected edges in random regular graphs
• Title not available (Why is that?)
• Packing, counting and covering Hamilton cycles in random directed graphs
• Packing, counting and covering Hamilton cycles in random directed graphs
• Title not available (Why is that?)
• Perfect fractional matchings in \(k\)-out hypergraphs
• An algorithm for finding hamilton cycles in random directed graphs
• Randomly n-cyclic digraphs
• Hamilton cycles in the union of random permutations
• Almost Ramsey type theorems for directed graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint)

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

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