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.
- Navigation Problem
- N-Cluster
- n-Cube
- Nearest Integer Function
- Nearest Neighbor Problem
- Near-Integer
- Near Noble Number
- Near-Pencil
- Necessary
- Necker Cube
- Necklace
- Needle
- Negation
- Negative
- Negative Binomial Distribution
- Negative Binomial Series
- Negative Integer
- Negative Likelihood Ratio
- Negative Pedal Curve
- Neighborhood
- Neile's Parabola
- Nephroid
- Nephroid Evolute
- Nephroid Involute
- Nerve