Turán graph

English

Etymology

Named after the Hungarian mathematician Pál Turán.

Noun

Turán graph (plural Turán graphs)

1. (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.

Hyponyms

• cocktail party graph

Related terms

• Turán's theorem