Square free graph : Graphs with minimum cycle length greater than 4.
Question : What is the maximum number of edges possible for a square free graph $G(V,E)$ given that $|V|$ = n. Is it of the order $O(n^2)$?
How does the answer change if max_degree(G) = d ($>1$)?
EDIT: Out of curiosity, what is the maximum number of edges with $n$ vertices, when we limit the girth of the graph to $l$.
Thanks in advance!