The saturation numbers sat(n, K^3_3) and sat(n, K^2_t) for t ≥ 4 are exactly determined, with explicit descriptions of the extremal n-vertex saturated 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
-
The saturation number of $K^s_t$
The saturation numbers sat(n, K^3_3) and sat(n, K^2_t) for t ≥ 4 are exactly determined, with explicit descriptions of the extremal n-vertex saturated graphs.