Turán's Theorem
Let 
be a Graph with Vertices 
andEdges 
on 
Vertices without a 
-Clique. Then
where
is the Edge Number. More precisely, the K-Graph 
with
for 
is the unique Graph without a -Clique with themaximal number of Edges 
.See also Clique, K-Graph, Turán Graph
References
Aigner, M. ``Turán's Graph Theorem.'' Amer. Math. Monthly 102, 808-816, 1995.
- Robbins Algebra
- Robbins Equation
- Robbin's Inequality
- Robertson Condition
- Robertson Conjecture
- Robertson-Seymour Theorem
- Robin Boundary Conditions
- Robin's Constant
- Robinson Projection
- Robust Estimation
- Rodrigues Formula
- Rodrigues's Curvature Formula
- Rogers-Ramanujan Continued Fraction
- Rogers-Ramanujan Identities
- Rolle's Theorem
- Roman Coefficient
- Roman Factorial
- Roman Numeral
- Roman Surface
- Roman Symbol
- Romberg Integration
- Rook Number
- Rook Reciprocity Theorem
- Rooks Problem
- Room Square