Turán graph
短语词形变化
Turán graphs
复数
Turán graphs
释义与例句
n.
-
1.
A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets.
数学
词源
Named after the Hungarian mathematician Pál Turán.
来源:wiktionary