On the hyperbolicity of random graphs

zbMath1300.05286arXiv1401.5678MaRDI QIDQ405243

Dieter Mitsche, Paweł Prałat

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.5678

zbMATH Keywords

random graphsdiameterhyperbolicity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Connectivity (05C40)

Related Items (4)

Data center interconnection networks are not hyperbolic ⋮ Geodesic cycles in random graphs ⋮ When can graph hyperbolicity be computed in linear time? ⋮ Mathematical properties on the hyperbolicity of interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-hereditary graphs
• Expanders are not hyperbolic
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs
• On the Hyperbolicity of Small-World and Treelike Random Graphs
• Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
• Geodesics and almost geodesic cycles in random regular graphs
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
• Packing and Covering δ-Hyperbolic Spaces by Balls
• 1-Hyperbolic Graphs
• Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze

This page was built for publication: On the hyperbolicity of random graphs