Turán Graph
The 
-Turán graph is the Extremal Graph on 
Vertices which contains no
-Clique. In other words, the Turán graph has the maximum possible number of Edges ofany -vertex graph not containing a Complete Graph 
. Turán's Theorem givesthe maximum number of edges 
for the -Turán graph. For 
,
so the Turán graph is given by the Complete Bipartite Graphs
See also Clique, Complete Bipartite Graph, Turán's Theorem
References
Aigner, M. ``Turán's Graph Theorem.'' Amer. Math. Monthly 102, 808-816, 1995.
- Orthocentric Quadrilateral
- Orthocentric System
- Orthocupolarotunda
- Orthodrome
- Orthogonal Array
- Orthogonal Basis
- Orthogonal Circles
- Orthogonal Curves
- Orthogonal Functions
- Orthogonal Group
- Orthogonal Group Representations
- Orthogonality Condition
- Orthogonality Theorem
- Orthogonal Lines
- Orthogonal Matrix
- Orthogonal Polynomials
- Orthogonal Projection
- Orthogonal Rotation Group
- Orthogonal Tensors
- Orthogonal Transformation
- Orthogonal Vectors
- Orthographic Projection
- Orthologic
- Orthonormal Basis
- Orthonormal Functions