Sidorenko,What we know and what we do not know about Turán numbers, Graphs Combin.11 (1995), no

· 1995

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2026-04-24 · unverdicted · novelty 7.0

The maximum running time of F-bootstrap percolation on n vertices is at most (π(F minus one edge) plus o(1)) times the number of possible edges.

Showing 1 of 1 citing paper.

Upper bounds on the running time of bootstrap percolation math.CO · 2026-04-24 · unverdicted · none · ref 20
The maximum running time of F-bootstrap percolation on n vertices is at most (π(F minus one edge) plus o(1)) times the number of possible edges.