Proves existence of lim ssat^{cn}(n,K_r)/n for most c in (0,1], asymptotics for r/(r+2)<c<1, exact ssat^Δ(n,K_r) for select Δ, and saturation relation for K_r ∨ F.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Degree-restricted semi-saturation numbers of cliques and its applications
Proves existence of lim ssat^{cn}(n,K_r)/n for most c in (0,1], asymptotics for r/(r+2)<c<1, exact ssat^Δ(n,K_r) for select Δ, and saturation relation for K_r ∨ F.
-
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.