gives the k-partite Turán graph with n vertices .

Details and OptionsDetails and Options

  • The Turán graph is the complete k-partite graph with n vertices whose partite sets are as nearly equal in cardinality as possible.
  • The Turán graph is equivalent to a complete k-partite graph CompleteGraph[{n1,,nk}], where ni is either TemplateBox[{{n, /, k}}, Ceiling] or TemplateBox[{{n, /, k}}, Floor].
  • TuranGraph takes the same options as Graph.
Introduced in 2010