Talk:Turán graph
 | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Untitled[edit]
Isn't this also known as a complete k-partite graph? At least Bondy and Murty (1982) call it that. Perhaps Turan's name was used for this graph after that publication? Should the article at least mention the name complete k-partite graph? 67.175.166.240 16:20, 1 May 2007 (UTC)
- I think a complete k-partite graph is a more general family of graphs in which the sizes of the parts need not be nearly equal. But I will look into finding a way to work that terminology into the article. —David Eppstein 16:35, 1 May 2007 (UTC)
The stated number of edges in the Turan graph is wrong. For instance, the 8-partit Turan graph on 12 vertices has only 62 edges while the formula yields 63 edges. 130.226.169.201 (talk) 12:35, 17 May 2008 (UTC)
Assessment comment[edit]
The comment(s) below were originally left at Talk:Turán graph/Comments, and are posted here for posterity. Following several discussions in past years, these subpages are now deprecated. The comments may be irrelevant or outdated; if so, please feel free to remove this section.
| Some explanation of technical terms (e.g. cograph) needed. Potential Good Article material. Tompw (talk) 15:57, 4 January 2007 (UTC) |
Last edited at 23:23, 19 April 2007 (UTC). Substituted at 02:39, 5 May 2016 (UTC)