×
Nemetz, T.; Kusolitsch, N.

A method of investigating the longest paths in certain random graphs. (English) Zbl 0504.60034

Ann. Probab. 11, 217-221 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0504.60034

Cited in 1 Review

MSC:

60F15 Strong limit theorems
60F10 Large deviations
05C20 Directed graphs (digraphs), tournaments

Keywords:

Erdős-Renyi laws; random graphs; longest runs

Citations:

Zbl 0225.60015
PDF BibTeX XML Cite
\textit{T. Nemetz} and \textit{N. Kusolitsch}, Ann. Probab. 11, 217--221 (1983; Zbl 0504.60034)
Full Text: DOI