Liu, Guanwu; Ma, Jie; Zu, Chunlei Optimal bisections of directed graphs. (English) Zbl 07784619 Random Struct. Algorithms 64, No. 1, 138-153 (2024). MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{G. Liu} et al., Random Struct. Algorithms 64, No. 1, 138--153 (2024; Zbl 07784619) Full Text: DOI arXiv
Pittel, Boris Counting strongly connected \((k_1,k_2)\)-directed cores. (English) Zbl 1401.05133 Random Struct. Algorithms 53, No. 1, 3-14 (2018). MSC: 05C20 05C30 05C40 PDFBibTeX XMLCite \textit{B. Pittel}, Random Struct. Algorithms 53, No. 1, 3--14 (2018; Zbl 1401.05133) Full Text: DOI arXiv
Hefetz, Dan; Steger, Angelika; Sudakov, Benny Random directed graphs are robustly Hamiltonian. (English) Zbl 1346.05271 Random Struct. Algorithms 49, No. 2, 345-362 (2016). MSC: 05C80 05C20 05C45 PDFBibTeX XMLCite \textit{D. Hefetz} et al., Random Struct. Algorithms 49, No. 2, 345--362 (2016; Zbl 1346.05271) Full Text: DOI arXiv
Pittel, Boris; Poole, Daniel Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs. (English) Zbl 1348.05196 Random Struct. Algorithms 49, No. 1, 3-64 (2016). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C20 05C42 PDFBibTeX XMLCite \textit{B. Pittel} and \textit{D. Poole}, Random Struct. Algorithms 49, No. 1, 3--64 (2016; Zbl 1348.05196) Full Text: DOI arXiv
Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny Longest cycles in sparse random digraphs. (English) Zbl 1270.05050 Random Struct. Algorithms 43, No. 1, 1-15 (2013). MSC: 05C20 05C38 05C80 PDFBibTeX XMLCite \textit{M. Krivelevich} et al., Random Struct. Algorithms 43, No. 1, 1--15 (2013; Zbl 1270.05050) Full Text: DOI arXiv
Greenhill, Catherine; McKay, Brendan D. Random dense bipartite graphs and directed graphs with specified degrees. (English) Zbl 1208.05066 Random Struct. Algorithms 35, No. 2, 222-249 (2009). MSC: 05C42 05C80 05C20 PDFBibTeX XMLCite \textit{C. Greenhill} and \textit{B. D. McKay}, Random Struct. Algorithms 35, No. 2, 222--249 (2009; Zbl 1208.05066) Full Text: DOI arXiv
Bohman, Tom; Frieze, Alan; Martin, Ryan How many random edges make a dense graph Hamiltonian? (English) Zbl 1013.05044 Random Struct. Algorithms 22, No. 1, 33-42 (2003). Reviewer: David B.Penman (Colchester) MSC: 05C45 05C80 PDFBibTeX XMLCite \textit{T. Bohman} et al., Random Struct. Algorithms 22, No. 1, 33--42 (2003; Zbl 1013.05044) Full Text: DOI arXiv
Bollobás, Béla; Riordan, Oliver; Spencer, Joel; Tusnády, Gábor The degree sequence of a scale-free random graph process. (English) Zbl 0985.05047 Random Struct. Algorithms 18, No. 3, 279-290 (2001). Reviewer: Ove Frank (Stockholm) MSC: 05C80 05C07 60G42 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 18, No. 3, 279--290 (2001; Zbl 0985.05047) Full Text: DOI Link
Cooper, Colin; Frieze, Alan Hamilton cycles in random graphs and directed graphs. (English) Zbl 0956.05066 Random Struct. Algorithms 16, No. 4, 369-401 (2000). Reviewer: D.V.Chopra (Wichita) MSC: 05C45 05C80 05C20 PDFBibTeX XMLCite \textit{C. Cooper} and \textit{A. Frieze}, Random Struct. Algorithms 16, No. 4, 369--401 (2000; Zbl 0956.05066) Full Text: DOI
Jaworski, Jerzy Predecessors in a random mapping. (English) Zbl 0964.60010 Random Struct. Algorithms 13, No. 3-4, 501-519 (1998). MSC: 60C05 05C80 60H25 PDFBibTeX XMLCite \textit{J. Jaworski}, Random Struct. Algorithms 13, No. 3--4, 501--519 (1998; Zbl 0964.60010) Full Text: DOI
Andersson, Pontus On the asymptotic distributions of subgraph counts in a random tournament. (English) Zbl 0959.05107 Random Struct. Algorithms 13, No. 3-4, 249-260 (1998). MSC: 05C80 05C20 60C05 PDFBibTeX XMLCite \textit{P. Andersson}, Random Struct. Algorithms 13, No. 3--4, 249--260 (1998; Zbl 0959.05107) Full Text: DOI
Łuczak, Tomasz; Thoma, Luboš Convergence of probabilities for the second order monadic properties of a random mapping. (English) Zbl 0883.03016 Random Struct. Algorithms 11, No. 3, 277-295 (1997). MSC: 03C13 05C80 03B15 PDFBibTeX XMLCite \textit{T. Łuczak} and \textit{L. Thoma}, Random Struct. Algorithms 11, No. 3, 277--295 (1997; Zbl 0883.03016) Full Text: DOI
Cooper, Colin On the 2-cyclic property in 2-regular digraphs. (English) Zbl 0842.05056 Random Struct. Algorithms 6, No. 4, 439-448 (1995). Reviewer: C.McDiarmid (Oxford) MSC: 05C38 05C20 60C05 05C80 68R10 PDFBibTeX XMLCite \textit{C. Cooper}, Random Struct. Algorithms 6, No. 4, 439--448 (1995; Zbl 0842.05056) Full Text: DOI
Brightwell, G. R.; Kohayakawa, Y. Ramsey properties of orientations of graphs. (English) Zbl 0794.05083 Random Struct. Algorithms 4, No. 4, 413-428 (1993). Reviewer: A.Ruciński (Poznań) MSC: 05C55 05C20 05C80 05C05 PDFBibTeX XMLCite \textit{G. R. Brightwell} and \textit{Y. Kohayakawa}, Random Struct. Algorithms 4, No. 4, 413--428 (1993; Zbl 0794.05083) Full Text: DOI
Frieze, Alan; Suen, Stephen Counting the number of Hamilton cycles in random digraphs. (English) Zbl 0771.05089 Random Struct. Algorithms 3, No. 3, 235-241 (1992). Reviewer: O.Frank (Stockholm) MSC: 05C80 05C20 05C38 05C85 05C30 05C45 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{S. Suen}, Random Struct. Algorithms 3, No. 3, 235--241 (1992; Zbl 0771.05089) Full Text: DOI
Karp, Richard M. The transitive closure of a random digraph. (English) Zbl 0712.68076 Random Struct. Algorithms 1, No. 1, 73-93 (1990). MSC: 68R10 05C80 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{R. M. Karp}, Random Struct. Algorithms 1, No. 1, 73--93 (1990; Zbl 0712.68076) Full Text: DOI