Prefer a chat interface with context about you and your work?
Girth of sparse graphs
Abstract For each fixed k ≥ 0, we give an upper bound for the girth of a graph of order n and size n + k . This bound is likely to be essentially best possible as n → ∞. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 194–200, …