Turán graph
= Turán graph
{wiki=Turán_graph}
The Turán graph, denoted as \\( T(n, r) \\), is a specific type of graph used in extremal graph theory, which studies the conditions under which graphs contain certain subgraphs. The Turán graph is designed to be the largest \\( K_\{r+1\} \\)-free graph (a graph that does not contain a complete subgraph of \\( r+1 \\) vertices) with \\( n \\) vertices.