Show that if the degree of every vertex in a graph on $n$ vertices is greater than $\frac{1+ \sqrt{4n-3}}{2}$, then the graph contains a cycle of length $4$.
This is a problem in extremal combinatorics, but I have no idea how to proceed as I am quite new to the topic.