组合数学 (Fall 2011)/Extremal graph theory: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

3 November 2011

17 August 2011

16 August 2011

  • curprev 08:1908:19, 16 August 2011‎ imported>WikiSysop‎ m 21,239 bytes 0‎ Protected "组合数学 (Fall 2011)/Extremal graphs" ([edit=sysop] (indefinite) [move=sysop] (indefinite))
  • curprev 08:1908:19, 16 August 2011‎ imported>WikiSysop‎ 21,239 bytes +21,239‎ Created page with '== Extremal Graph Theory == Extremal grap theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" === Mantel…'
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2011)/Extremal_graph_theory"