Talk:Extremal graph theory
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Assessment comment[edit]
The comment(s) below were originally left at Talk:Extremal graph theory/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.
| Article currently only has a couple of particular results, there is vastly more to cover in any thorough survey of the subject. Joseph Myers 01:08, 21 May 2007 (UTC) |
Last edited at 01:08, 21 May 2007 (UTC). Substituted at 02:05, 5 May 2016 (UTC)
property <> invariant[edit]
Read in article:
- given a graph property P, an invariant u, and a set of graphs H
Follow link, read
- In graph theory, a graph property or graph invariant is ...
So, property and invariant of grapth are the same things...
Why here are used two different words?
Jumpow (talk) 14:13, 23 May 2017 (UTC) There are clear errors in this article. The number of vertices determine the order of the graph, the number of edges determine the size. Yet the beginning of the article states vertices=size. Whoever wrote most of this does not know graph theory well. — Preceding unsigned comment added by 2605:6000:1526:4538:7D9A:176B:FED7:5BC7 (talk) 19:14, 22 July 2020 (UTC)