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.
- Cancellation Law
- Cannonball Problem
- Canonical Form
- Canonical Polyhedron
- Canonical Transformation
- Cantor Comb
- Cantor-Dedekind Axiom
- Cantor Diagonal Method
- Cantor Diagonal Slash
- Cantor Dust
- Cantor Function
- Cantor's Equation
- Cantor Set
- Cantor's Paradox
- Cantor Square Fractal
- Cantor's Theorem
- Cap
- Capacity
- Capacity Dimension
- Carathéodory Derivative
- Carathéodory's Fundamental Theorem
- Cardano's Formula
- Cardinality
- Cardinal Number
- Cardioid