Abstract: The Kneser graph is the graph whose vertices are pairs of elements 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 and also find its exact values for small. © Pleiades Publishing, Ltd. 2024.