Extremal Graph Theory and Ramsey Theory · Hard problem

What is the maximum number of edges in a graph on $6$ vertices that contains no $4$-cycle?