Talk:Turán's theorem

Merger discussion.

It has been suggested that Turán graph be merged into Turán's theorem. I am opposed, because I believe Turán graphs have relevance in graph theory beyond Turán's theorem, as I hope I have made clear with my recent update to Turán graph. In addition, Turán graph is a natural member of Category:Graphs while Turán's theorem does not fit there, so after a merger someone looking through that category for interesting example graphs to try for some other problem would not find the Turán graphs. —David Eppstein 06:23, 2 October 2006 (UTC)[reply]

I agree - we can have the extremal object on a different page from the theorem about extremals. Charles Matthews 09:36, 2 October 2006 (UTC)[reply]

.. me too Vonkje 21:35, 26 November 2006 (UTC)[reply]

Problem with formula under "Formal Statement" section

I don't think the formula is equivalent to the formulation at the end. It is not incorrect, just that in some cases, it can give more edges than what's in the Turan graph. For example, T(13, 9) has only 74 edges, but the formula gives 75. — Preceding unsigned comment added by 169.234.241.86 (talk) 00:19, 18 November 2013 (UTC)[reply]

I agree with the comment above. "The same formula gives the number of edges in the Turán graph

T(n,r)

" is simply incorrect, as has been noted, for example, on MSE. Vince Vatter (talk) 11:06, 2 September 2021 (UTC)[reply]

Assessment comment

The comment(s) below were originally left at Talk:Turán's theorem/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.

Needs diagram of Turán graph, plus material on motivation and applications. Tompw (talk) 15:59, 4 January 2007 (UTC)[reply]

Last edited at 23:22, 19 April 2007 (UTC). Substituted at 02:39, 5 May 2016 (UTC)