Exact weak saturation number of K_{s,t} is found on s+t+1 vertices when gcd(s,t)=1, and new bounds are given for up to s+t+j vertices.
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
-
Weak saturation numbers of large complete bipartite graphs
Exact weak saturation number of K_{s,t} is found on s+t+1 vertices when gcd(s,t)=1, and new bounds are given for up to s+t+j vertices.