Saturation in Kneser graphs

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$.