Abstract:
The Kneser graph $\operatorname{KG}(n,2)$ is the graph whose vertices are pairs of elements $\{1,\dots,n\}$ and whose edges are drawn between disjoint pairs. In the present paper, we establish that the triangle saturation number of the Kneser graph is equal to $(3/2)n^2+O(n)$ and also find its exact values for small $n$.
Citation:
S. V. Vakhrushev, M. E. Zhukovskii, A. Yu. Skorkin, “Saturation in Kneser graphs”, Mat. Zametki, 116:2 (2024), 185–194; Math. Notes, 116:2 (2024), 200–208