K-graph | maximally saturated graph

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.

bipartite graph | clique | complete bipartite graph | complete graph | complete k-partite graph | extremal graph | extremal graph theory | k-partite graph | Turán's theorem