Graphs without quadrilaterals

Let f(n) denote the maximum number of edges of a graph on n vertices not containing a circuit of length 4. It is well known that $\text{f(n) ～}\text{1}\text{2}\text{n}\text{n}$. The old conjecture $\text{f(q}{}^2\text{+ q + 1) =}\text{1}\text{2}\text{q(q + 1)}{}^2$ is proved for infinitely many q (whenever q = 2^k).