Skip to main content
SpringerLink
Log in

On the strength of connectedness of a random graph

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. D. König,Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).

  2. C. Berge,Théorie des graphes et ses applications (Paris, 1958).

  3. L. R. Ford andD. R. Fulkerson, Maximal flow through a network,Canadian Journal of Math.,8 (1956), p. 399.

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Erdős andA. Rényi, On random graphs. I,Publ. Math. Debrecen,6 (1959), pp. 290–297.

    MathSciNet  Google Scholar 

  5. P. Erdős andA. Rényi, On the evolution of random graphs,Publ. Math. Inst. Hung. Acad. Sci.,5 (1960), pp. 17–61.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Budapest

    P. Erdős (corresponding member of the Academy) & A. Rényi (member of the Academy)

Authors
  1. P. Erdős
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Rényi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02066689

Keywords

Search

Navigation