For any graph G on t vertices and k at least 3, the maximum running time of the F-process where F is the k-extension of G is bounded by a constant C_{k,t} independent of n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bootstrap percolation of extension hypergraphs
For any graph G on t vertices and k at least 3, the maximum running time of the F-process where F is the k-extension of G is bounded by a constant C_{k,t} independent of n.