Article PDF
Avoid common mistakes on your manuscript.
References
D. König,Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).
C. Berge,Théorie des graphes et ses applications (Paris, 1958).
L. R. Ford andD. R. Fulkerson, Maximal flow through a network,Canadian Journal of Math.,8 (1956), p. 399.
P. Erdős andA. Rényi, On random graphs. I,Publ. Math. Debrecen,6 (1959), pp. 290–297.
P. Erdős andA. Rényi, On the evolution of random graphs,Publ. Math. Inst. Hung. Acad. Sci.,5 (1960), pp. 17–61.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Erdős, P., Rényi, A. On the strength of connectedness of a random graph. Acta Mathematica Academiae Scientiarum Hungaricae 12, 261–267 (1964). https://doi.org/10.1007/BF02066689
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02066689