The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected

DOI10.1016/0095-8956(90)90134-LzbMath0702.05073DBLPjournals/jct/CooperF90OpenAlexW1528229596WikidataQ57401602 ScholiaQ57401602MaRDI QIDQ914707

Colin Cooper, Alan M. Frieze

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90134-l

zbMATH Keywords

random digraphstrongly connectedalgorithm connect

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

The Strongly Connected Components of 1-in, 1-out ⋮ On the 2‐cyclic property in 2‐regular digraphs ⋮ On the existence of Hamilton cycles with a periodic pattern in a random digraph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• On the connectivity of random m-orientable graphs and digraphs
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected