Infinite graphs that do not contain cycles of length four

Abstract

We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs $G_n$ induced by the first $n$ vertices has minimum degree $\delta (G_n)>n^{\sqrt{2}-1+o(1)}$.

This paper has been withdrawn because we have found an easier proof of the result