The Turán graph, denoted by T {\displaystyle T}, is a complete multipartite graph; it is formed by partitioning a set of n {\displaystyle n} vertices into r {\displaystyle r} subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Wikipedia