For integers and , we determine the exact value of the function , that represents the maximum number of edges in a -free graph of order . This result was already known when . To do that, for , we provide a family of graphs such that and with the property that reaches girth with the minimum number of vertices. Also, we determine an infinity family of solutions of the problem .