Skip to main content
SpringerLink
Log in

Diameters of random bipartite graphs

  • Published:
Combinatorica 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. Z. W. Birnbaum, J. D. Esary andS. C. Saunders, Multicomponent systems and structures and their reliability,Technometrics 3 (1961), 55–77.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Bollobás,Graph Theory, Springer-Verlag, New York, 1979.

    MATH  Google Scholar 

  3. B. Bollobás, The diameter of random graphs,Trans. Amer. Math. Soc. 267 (1981), 41–52.

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Bollobás, Counting coloured graphs of high connectivity,Canad. J. Math. 33 (1981), 476–484.

    MATH  MathSciNet  Google Scholar 

  5. B. Bollobás,Random Graphs, in preparation.

  6. L. Comtet,Advanced Combinatorics, D. Reidel Publ. Co. Dordrecht, Holland, 1974.

    MATH  Google Scholar 

  7. P. Erdős andA. Rényi, On the strength of connectedness of a random graph.Acta Math. Acad Sci. Hungar. 12 (1961), 261–267.

    Article  MathSciNet  Google Scholar 

  8. V. L. Klee andD. G. Larman, Diameters of random graphs,Canad. J. Math. 33 (1981), 618–640.

    MATH  MathSciNet  Google Scholar 

  9. V. L. Klee, D. G. Larman andE. M. Wright, The diameter of almost all bipartite graphs,Studia Sci. Math. Hungar. 15 (1980), 39–43.

    MATH  MathSciNet  Google Scholar 

  10. V. L. Klee D. G. Larman andE. M. Wright, The proportion of labelled bipartite graphs which are connected,J. London Math. Soc. 24 (1981), 397–404.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. D. Korshunov, On the diameter of random graphs,Soviet Mat. Dokl. 12 (1971), 302–305.

    MATH  Google Scholar 

  12. A. D. Korshunov, Solution of a problem of Erdős and Rényi on Hamilton cycles in nonoriented graphs,Soviet Mat. Dokl. 17 (1976), 760–764.

    MATH  Google Scholar 

  13. J. W. Moon andL. Moser, Almost all (0, 1) matrices are primitive,Studia Sci. Math. Hungar. 1 (1966), 153–156.

    MATH  MathSciNet  Google Scholar 

  14. L. Pósa, Hamiltonian circuits in random graphs,Discrete Math. 14 (1976), 359–364.

    Article  MATH  MathSciNet  Google Scholar 

  15. Thanh le Cong, Estimates of some parameters of finite graphs with applications (in Russian),Elektr. Inform. Kyber. 13 (1977), 505–521.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Trinity College, CB2 1TQ, Cambridge, England

    Béla Bollobás

  2. Department of Mathematics, University of Washington GN-50, 98 195, Seattle, WA, USA

    Victor Klee

Authors
  1. Béla Bollobás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Klee
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Paul Erdős on his seventieth birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bollobás, B., Klee, V. Diameters of random bipartite graphs. Combinatorica 4, 7–19 (1984). https://doi.org/10.1007/BF02579152

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation