Turán graph

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

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

Noun[edit]

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[edit]

Related terms[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=Turán_graph&oldid=76462103"