Turan’s theorem

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

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

edges.

随便看

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。