Skip to main content
Log in

The diameter of random regular graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We give asymptotic upper and lower bounds for the diameter of almost everyr-regular graph onn vertices (n → ∞).

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. A. Bender andE. R. Canfield, The asymptotic number of labelled graphs with given degree sequences,J. Combinatorial Theory (A) 24 (1978) 296–307.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Bollobás,Extremal Graph Theory, Academic Press, London, New York and San Francisco, 1978.

    MATH  Google Scholar 

  3. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs,Europ. J. Combinatorics 1 (1980). 311–316.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bollobás, B., Fernandez de la Vega, W. The diameter of random regular graphs. Combinatorica 2, 125–134 (1982). https://doi.org/10.1007/BF02579310

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Navigation