2002/01/24 by Béla Bollobás, Endre Szemerédi · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Discrete mathematics #Finite Group Theory Research #Girth (graph theory) #Graph #Graph power #Line graph #Mathematics #Odd graph #Pathwidth #Triangle-free graph #Upper and lower bounds #graph theory and CDMA systems
paper · pdf · doi:10.1002/jgt.10023
openalex publication_date 2002/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31
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