For twin-free K_r-saturated graphs, the minimum edge count is asymptotically between (r+2)n and (r+3)n, and for triangles between (5+2/3)n and 6n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs
For twin-free K_r-saturated graphs, the minimum edge count is asymptotically between (r+2)n and (r+3)n, and for triangles between (5+2/3)n and 6n.