# Turan’s theorem

A graph with $n$ vertices, which contains no $p$-http://planetmath.org/node/1757clique with $p\ge 2$, has at most

$$\left(1-\frac{1}{p-1}\right)\frac{{n}^{2}}{2}$$ |

edges.

Title | Turan’s theorem |
---|---|

Canonical name | TuransTheorem |

Date of creation | 2013-03-22 12:44:10 |

Last modified on | 2013-03-22 12:44:10 |

Owner | mathwizard (128) |

Last modified by | mathwizard (128) |

Numerical id | 5 |

Author | mathwizard (128) |

Entry type | Theorem |

Classification | msc 05C99 |