For almost all p, the number of non-isomorphic induced subgraphs of G(n,p) is determined asymptotically, with a sharp threshold at 1/n and full 2^n behavior after 2 ln n/n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Non-isomorphic subgraphs in random graphs
For almost all p, the number of non-isomorphic induced subgraphs of G(n,p) is determined asymptotically, with a sharp threshold at 1/n and full 2^n behavior after 2 ln n/n.