Xrfgtjtk

There is already a proof verification question on the site about Mantel's theorem, but the other proof looks very different to mine, uses Cauchy-Schwarz, etc.

First of all, the theorem:

Theorem (Mantel's Theorem). A graph $G$ is maximally triangle-free with respect to edges only if $$m = leftlfloorfrac{n^2}{4}rightrfloor.$$

Now my proof is by induction on the number of vertices. The idea is to take advantage of the fact that the desired graph is $K_{lfloor n/2rfloor,lceil n/2rceil}$, which we actually know from Turán's theorem.

Proof. Suppose $G$ is an $n$-vertex graph on $m$ edges that contains no triangles. Then any two adjacent vertices $u$ and $v$ cannot share a common neighbour, so $N(u) cap N(v) = varnothing$. Thus
begin{align*}
deg(u) + deg(v) = |N(u)| + |N(v)| &= |N(u) cup N(v)| - |N(u) cap N(v)|\
&leqslant |V(G)| - |varnothing| = n.
end{align*}
Now remove two adjacent vertices $u$ and $v$ from $G$ to get $G'$. By induction, this has $lfloor (n-2)^2/4rfloor$ edges. Thus
begin{align*}
m &= leftlfloorfrac{(n-2)^2}{4}rightrfloor + deg(u) + deg(v) - 1 qquadtext{(since $deg(u) + deg(v)$ counts ${u,v}$ twice)}\
&leqslant frac{(n-2)^2}{4} + n - 1 = frac{n^2}{4}.
end{align*}
It suffices to show that a triangle-free graph on $n$ vertices and $lfloor n^2/4rfloor$ edges always exists, since it must have maximal edges by the inequality $m leqslant n^2/4$ we have just obtained. Indeed, the complete bipartite graph $K_{lfloor n/2rfloor, lceil n/2rceil}$ has no cycles and in particular no triangles, is on $lfloor n/2rfloor + lceil n/2rceil = n$ vertices and has
$$leftlfloorfrac{n}{2}rightrfloorleftlceilfrac{n}{2}rightrceil = begin{cases}
displaystyleleft(frac{n}{2}right)left(frac{n}{2}right) = frac{n^2}{4} = leftlfloor frac{n^2}{4} rightrfloor & text{if $n$ is even}\[15pt]
displaystyleleft(frac{n-1}{2}right)left(frac{n+1}{2}right) = frac{n^2 - 1}{2} = leftlfloor frac{n^2}{4} rightrfloor & text{if $n$ is odd}
end{cases} $$
edges, as required. $square$

I'd appreciate any feedback about this proof.