1985/09/01 by Charles Delorme · 54 citations
Mathematics · Computer Science · #Graph theory and applications #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Combinatorics #Bipartite graph #Mathematics #Degree (music) #Complete bipartite graph #Discrete mathematics #Pancyclic graph #Chordal graph #Graph #1-planar graph
paper · doi:10.1002/jgt.3190090304
published in Journal of Graph Theory 9(3), 325-334 (Wiley)
openalex publication_date 1985/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
Abstract We give constructions of bipartite graphs with maximum Δ, diameter D on B vertices, such that for every D ≥ 2 the lim inf Δ→∞ B . Δ 1‐D = b D > 0. We also improve similar results on ordinary graphs, for example, we prove that lim Δ→∞ N · Δ −D = 1 if D is 3 or 5. This is a partial answer to a problem of Bollobás.