On the number of induced subgraphs of a random graph (Q1103632)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of induced subgraphs of a random graph |
scientific article; zbMATH DE number 4053651 |
Statements
On the number of induced subgraphs of a random graph (English)
0 references
1987
0 references
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.
0 references
random graphs
0 references
labelled graphs
0 references
0.8182337880134583
0 references
0.8142282366752625
0 references
0.8116428852081299
0 references
