On the number of induced subgraphs of a random graph
type: Item
instance of: scholarly article
title: On the number of induced subgraphs of a random graph
zbMATH Open document ID: 0646.05031
DOI: 10.1016/0012-365X(87)90201-9
author: B. George
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: Let \(G_ n\) be a graph selected at random from the set of all labelled graphs of order n. This paper shows that for many a type, the number of induced subgraphs of that type in \(G_ n\) is asymptotically normally distributed as n tends to infinity.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 4053651
zbMATH Keywords: random graphs
zbMATH Keywords: labelled graphs
MaRDI profile type: Publication
cites work: Poisson convergence and random graphs
cites work: Threshold functions for small subgraphs
cites work: Q3286850
cites work: A review of random graphs
cites work: On random simplices in product distributions
cites work: Limit theorems for complete subgraphs of random graphs
description: scientific article; zbMATH DE number 4053651