For any fixed graph H the critical percolation threshold p_c(n,H) equals the value determined by the minimal activation density ρ(H) of graphs that efficiently activate an edge.
P. J. Cameron, Combinatorial Surveys (Proceedings of the Sixth British Combinatorial Conference, Academic Press, 1977.)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The critical activation density in graph bootstrap percolation
For any fixed graph H the critical percolation threshold p_c(n,H) equals the value determined by the minimal activation density ρ(H) of graphs that efficiently activate an edge.