Talk:Turán graph

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	B Class	Mid Priority	Field: Discrete mathematics
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Some explanation of technical terms (e.g. cograph) needed. Potential Good Article material. Tompw (talk) 15:57, 4 January 2007 (UTC)

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)