maximum bound for edges in graph `G` if we want shortest cycle stay at `k`.

Question

In a simple graph G, what is the maximum bound for edges if we want shortest cycle stay at k.

How we can find this bound for a graph? Have it any formula or technique to calculate it?

thanks in advance