This is a preview of subscription content, log in via an institution to check access.
References
L. Comtet,Analyse combinatoire, II, Presses Universitaires de France, Paris, 1970.MR 41 # 6697
P. Erdős andA. Rényi, On the evolution of random graphs,Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 17–61.MR 23 # A2338
P. Erdős andJ. Spencer,Probabilistic methods in combinatorics, Academic Press, New York, 1974.MR 52 # 2895
W. Feller,An introduction to probability theory and its applications, I, 3rd ed., Wiley, New York, 1968.MR 37 # 3604
E. N. Gilbert, Random graphs,Ann. Math. Statist. 30 (1959), 1141–1144.MR 21 # 7551
G. R. Grimmett, Random graph theorems,Proc. 7th Prague Conference on Information Theory and Related Topics (1974). (To appear)
G. R. Grimmett andC. J. McDiarmid, On colouring random graphs,Math. Proc. Cambridge Philos. Soc. 77 (1975), 313–324.MR 51 # 5365
M. Loève,Probability theory, 3rd ed., Van Nostrand, Princeton, 1963.MR 34 # 3596
D. W. Matula, On the complete subgraphs of a random graph.Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (1970), Univ. North Carolina, Chapel Hill, 1970, 356–369.MR 42 # 1699
K. Schürger,Über die Entwicklung zufälliger p-partiter Graphen, Universität Heidelberg, 1974. (Unpublished thesis)
K. Schürger, On the evolution of random graphs over expanding square lattices,Acta Math. Acad. Sci. Hungar. 27 (1976), 281–292.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schürger, K. Limit theorems for complete subgraphs of random graphs. Period Math Hung 10, 47–53 (1979). https://doi.org/10.1007/BF02018372
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02018372