Girth of sparse graphs

  • Authors:

  • Béla Bollobás;Endre Szemerédi

  • Affiliations:

  • Department of Mathematical Sciences, University of Memphis, Memphis, Tennessee 38152 and Trinity College, Cambridge, CB2 1TQ, UK;Department of Computer Science, Rutgers University, New Brunswick, New Jersey 08903

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

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, 2002; DOI 10.1002-jgt.10023