Let $P$ be a property of graphs such that if a graph $G$ has $P$, then any graph obtained from $G$ by removal of a vertex also has $P$.
Let $g(n)$ be the maximum size of a graph of order $n$ having $P$. It can be shown that for $n>2$, $$g(n) \leq \left\lfloor \frac{n}{n-2}\cdot g(n-1)\right\rfloor.$$ I suspect this inequality is well known, and would like to have a reference rather than proving it from scratch. Any pointers will be appreciated!
Consider a graph $G$ with $g(n)$ edges. $G$ has average degree $2g(n)/n$ so there is a vertex $v$ with degree at most $$\delta = \left\lfloor \frac{2g(n)}{n}\right\rfloor.$$ Since by assumption $G-v$ has the property, $g(n-1) \ge g(n)-\delta$. Now solve this inequality for $g(n)$.
Write $2g(n)=an+b$ for $0\le b\le n-1$, then you can expand the floor and solve for $a$. Put that back into $an+b$ and you get (for $n\ge 3$) $$ g(n) \le \frac{n g(n-1)-b}{n-2},$$ which implies the given inequality.
You might think that the $-b$ in the last numerator allows for a slightly tighter inequality, but I think it doesn't. At the moment I have forgotten the reasoning there.
