On the number of induced subgraphs of a random graph
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.
scientific article; zbMATH DE number 4053651