# On properties of extremal graphs

Let H be a graph, and define $c_n(H) := \frac{ex(n, H)}{\frac{n(n-1)}{2}}$ Prove that $c_n(H) \leq c_{n−1}(H)$, and show that $\lim_{n→∞} c_n(H)$ exists.

So first of all, if we managed to show that the inequality holds, then this means that $(c_n(H))$ is a decreasing sequence bounded by $0$ and so the limit will exist.

The inequality is equivalent to $$\frac{ex(n, H)}{n} \leq \frac{ex(n-1, H)}{n-2}$$

I have no idea how to proceed. The only inequality I know about extremal graphs is that if $H$ has chromatic number $r+1$, then it certainly isn't $r$-partite so the Turan graph $T_r(n)$ will contain no copy of $H$. But this certainly won't work

Any hints/suggestions are appreciated

• What is $ex(n,H)$?
– Aqua
Jun 11 '18 at 16:19
• $ex(n, H) = \max\{e(G) : |G| = n, G \text{ contains no copy of } H\}$
– asdf
Jun 11 '18 at 16:22
• Sep 13 '18 at 17:21

Hint: remove a vertex of minimum degree from a graph not containing $H$.
Proof: Suppose $G$ is a graph on $n$ vertices and $\text{ex}(n, H)$ edges that does not contain a copy of $H$. Then there is a vertex $v$ of $G$ of degree no more than $2\text{ex}(n, H)/n$, by a simple averaging argument. Upon deleting $v$, $G - v$ has at least $\text{ex}(n, H)(1-\frac{2}{n})$ edges and $n-1$ vertices, and $G-v$ also does not contain a copy of $H$. Thus $$\text{ex}(n-1, H) \geq \text{ex}(n, H) (1-2/n)$$ and the desired inequality follows.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}