Edges in graphs with large girth (Q1180673)

The authors give several upper bounds on the number of edges \(q\) in a graph, in terms of its order \(p\) and girth \(g\) (and, in certain cases, minimum degree is also involved). In particular, one upper bound has the asymptotic order \(p^{1+2/(g-1)}\) for \(g\) odd; the conjectured correct asymptotic value is \(p^{1+2/g}\). Another interesting example is the inequality \(g\leq 2+2\log_ k(p/4)\) where \(k=\lfloor q/p\rfloor\geq 2\). Asymptotic and numerical comparisons are included.