Turán graph en · NOUN
Etymology
Named after the Hungarian mathematician Pál Turán.
Meanings
- 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.
Forms
| Spelling | Features | Labels | Source |
|---|---|---|---|
| Turán graphs | Number=Plur | lexicographic |