On the number of induced subgraphs of a random graph

From MaRDI portal
(Redirected from Publication:1103632)





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.











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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103632)