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 ,

References

Aigner, M. ``Turán's Graph Theorem.'' Amer. Math. Monthly 102, 808-816, 1995.

• Cissoid of Diocles Caustic
• Cissoid of Diocles Inverse Curve
• Cissoid of Diocles Pedal Curve
• Clairaut's Differential Equation
• Clarity
• Clark's Triangle
• Class
• Class (Group)
• Classical Groups
• Classification
• Classification Theorem
• Class Interval
• Class (Map)
• Class (Multiply Perfect Number)
• Class Number
• Class Number Formula
• Class Representative
• Class (Set)
• Clausen Formula
• Clausen Function
• Clausen's Integral
• CLEAN Algorithm
• CLEAN Beam
• CLEAN Map
• Clebsch-Aronhold Notation