On the number of induced subgraphs of a random graph

DOI10.1016/0012-365X(87)90201-9zbMath0646.05031MaRDI QIDQ1103632

B. George

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphslabelled graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (4)

Asymptotic normality of graph statistics ⋮ A central limit theorem for decomposable random variables with applications to random graphs ⋮ A threshold for the size of random caps to cover a sphere ⋮ The asymptotic distributions of generalized U-statistics with applications to random graphs

Cites Work

• Limit theorems for complete subgraphs of random graphs
• On random simplices in product distributions
• Threshold functions for small subgraphs
• Poisson convergence and random graphs
• A review of random graphs
• Unnamed Item

This page was built for publication: On the number of induced subgraphs of a random graph