Determines sat(K_4^n, C_4) exactly for n ≥ 2 and characterizes all minimum C4-saturated subgraphs of K_k^n for k ≥ 4 and n ≥ 2.
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
-
All minimum $C_4$-saturated multipartite graphs
Determines sat(K_4^n, C_4) exactly for n ≥ 2 and characterizes all minimum C4-saturated subgraphs of K_k^n for k ≥ 4 and n ≥ 2.