The critical probability for the existence of a K3-activating spanning tree in G(n,p) is p = n^{-1/3-o(1)}.
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
ACCEPT 1representative citing papers
citing papers explorer
-
When does a tree activate the random graph?
The critical probability for the existence of a K3-activating spanning tree in G(n,p) is p = n^{-1/3-o(1)}.