Skip to main content

On the number of strictly balanced subgraphs of a random graph

Part of the Lecture Notes in Mathematics book series (LNM,volume 1018)

Abstract

In this paper we consider the asymptotic distribution of the number of strictly balanced subgraphs of a random graph. We prove that, under certain conditions imposed on the probability of occurence of edges, this number has the Poisson or the standarized normal distribution. It generalizes several results dealing with subgraphs of various kinds of random graph.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MathSciNet  MATH  Google Scholar 

  2. M. Karoński, On the number of k-trees in a random graph, (to appear).

    Google Scholar 

  3. K. Schürger, Limit theorems for complete subgraphs of random graphs, Periodica Mathematica Hungarica, 10 (1979), 47–53.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Karoński, M., Ruciński, A. (1983). On the number of strictly balanced subgraphs of a random graph. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071616

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12687-4

  • Online ISBN: 978-3-540-38679-7

  • eBook Packages: Springer Book Archive