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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci., 5 (1960), 17–61.
M. Karoński, On the number of k-trees in a random graph, (to appear).
K. Schürger, Limit theorems for complete subgraphs of random graphs, Periodica Mathematica Hungarica, 10 (1979), 47–53.
Author information
Authors and Affiliations
Editor information
Rights 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