Turán graph
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after the Hungarian mathematician Pál Turán.
Noun[edit]
Turán graph (plural Turán graphs)
- (graph theory) 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.