Asymptotically optimal lower bounds on weak saturation numbers for r-uniform hypergraphs are proved via a polymatroid method generalizing the linear-algebraic approach for graphs.
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
-
Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs
Asymptotically optimal lower bounds on weak saturation numbers for r-uniform hypergraphs are proved via a polymatroid method generalizing the linear-algebraic approach for graphs.