组合数学 (Fall 2023)/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.

4 May 2023

  • curprev 08:5508:55, 4 May 2023‎ Etone talk contribs‎ 18,939 bytes +18,939‎ Created page with "== Forbidden Cliques == Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" === Mantel's theorem === We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</math>. {{Theorem|Theorem (Mantel 1907)| :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <m..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2023)/Extremal_graph_theory"