Turán graph

noun

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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

nounTurán graph (plural Turán graphs)

plural Turán graphs

  1. graph theoryA 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.

Origin

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

Full word history & related roots →
Cite this entry
APA

Turán graph. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/Tur%C3%A1n%20graph

MLA

“Turán graph.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Tur%C3%A1n%20graph. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “Turán graph,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/Tur%C3%A1n%20graph.

Source: Turán graph on Wiktionary, CC BY-SA 4.0.