|
|||||
|
|
Girth of sparse graphs |
|
| Authors: | Bla Bollobs Endre Szemerdi |
| Institution: | Béla Bollobás,Endre Szemerédi |
| 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 |
| Keywords: | girth cycle sparse graph |