Skip to main content
Log in

Random graphs of binomial type with sparsely-edged initial graphs

  • Published:
Acta Mathematica Hungarica Aims and scope Submit manuscript

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.

References

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

    Google Scholar 

  2. P. Erdős, J. Spencer, Evolution of then-cube,Computat. Math. 5 (1979), 33–39.

    Google Scholar 

  3. Z. Füredi, On connectedness of a random graph with a small number of edges,Studia Sci. Math. Hung.,14 (1979), 419–425.

    Google Scholar 

  4. V. A. Gadasin, Asymptotic characteristics of the connectedness of a planar random graph in the form of a lattice,Izv. Akad. Nauk SSSR Tech. Kib.,4 (1979), 140–149.

    Google Scholar 

  5. M. V. Lomonosov, V. P. Polessky, Reliability upper bound for information networks,Prob. Inf. Trans.,7 (4) (1971), 337–339.

    Google Scholar 

  6. A. Ruciński, Subgraphs of random graphs: A general approach,Annals Disc. Math.,28 (1985), 221–229.

    Google Scholar 

  7. K. Schürger, On the evolution of random graphs over expanding square lattices,Acta Math. Acad. Sci. Hung.,27 (1976), 281–292.

    Google Scholar 

  8. G. R. Grimmett, The largest component in a random lattice,Tech. Rap. (1983).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ruciński, A. Random graphs of binomial type with sparsely-edged initial graphs. Acta Math Hung 47, 81–87 (1986). https://doi.org/10.1007/BF01949127

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation