点击下载:南京大学:《组合数学》课程教学资源(课堂讲义)极值图论 Extremal graph theory
正在加载图片...
Turan's Theorem "Suppose G is a Kr-free graph. What is the largest number of edges that G can have?" Paul Turan (1910-1976) Turán's Theorem Paul Turán (1910-1976) “Suppose G is a Kr -free graph. What is the largest number of edges that G can have?
<<向上翻页
向下翻页>>
点击下载:南京大学:《组合数学》课程教学资源(课堂讲义)极值图论 Extremal graph theory
©2008-现在 cucdc.com 高等教育资讯网 版权所有