A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n vertices originally considered by Turán. There are unfortunately two different conventions for the index k.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.