点击下载:南京大学:《组合数学》课程教学资源(课堂讲义)极值图论 Extremal graph theory
正在加载图片...
Turan's Theorem Theorem(Turan 1941) If G(V,E)has IVl=n and is K,-free,then r-2 E≤ n2. 2(r-1Turán's Theorem Theorem (Turán 1941) If G(V,E) has |V|=n and is Kr-free, then |E| ⇥ r 2 2(r 1)n2
<<向上翻页
向下翻页>>
点击下载:南京大学:《组合数学》课程教学资源(课堂讲义)极值图论 Extremal graph theory
©2008-现在 cucdc.com 高等教育资讯网 版权所有