Turán graph
nounEtymology Named after the Hungarian mathematician Pál Turán.
1
Graph theory, Mathematics, Sciences 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.
- Related terms
- Turán's theorem
- Hyponyms
- cocktail party graph