Original sentence: The Kneser graph KG2n − 1,n − 1 is known as the odd graph On; the odd graph O3 = KG5,2 is isomorphic to the Petersen Graph.The complete graph on n vertices is the Kneser graph KGn,1
Edited sentence: The Kneser graph  is known as the odd graph ; the odd graph  is isomorphic to the Petersen Graph.The complete graph on  vertices is the Kneser graph