Turán number
= Turán number
{wiki=Turán_number}
The Turán number, denoted as \\( T(n, r) \\), is a concept in combinatorial mathematics, specifically in the field of graph theory. It represents the maximum number of edges in a graph with \\( n \\) vertices that does not contain any complete subgraph (or clique) with \\( r \\) vertices. In other words, it provides an upper limit on the edge count of a graph while avoiding certain cliques.