“Turán Graph”的概念、定义、习题解题方法及翻译-数学辞典

单词

Turán Graph

释义

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 ,

so the Turán graph is given by the Complete Bipartite Graphs

See also Clique, Complete Bipartite Graph, Turán's Theorem

References

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

随便看

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