Turán graphs

A form of Turán graph — 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

noun
  1. pluralplural of Turán graph
Cite this entry
APA

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

MLA

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

Chicago

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

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