Graphs with convex balls
From MaRDI portal
Abstract: In this paper, we investigate the graphs in which all balls are convex and the groups acting on them geometrically (which we call CB-graphs and CB-groups). These graphs have been introduced and characterized by Soltan and Chepoi (1983) and Farber and Jamison (1987). CB-graphs and CB-groups generalize systolic (alias bridged) and weakly systolic graphs and groups, which play an important role in geometric group theory. We present metric and local-to-global characterizations of CB-graphs. Namely, we characterize CB-graphs as graphs whose triangle-pentagonal complexes are simply connected and balls of radius at most are convex. Similarly to systolic and weakly systolic graphs, we prove a dismantlability result for CB-graphs : we show that their squares are dismantlable. This implies that the Rips complexes of CB-graphs are contractible. Finally, we adapt and extend the approach of Januszkiewicz and Swiatkowski (2006) for systolic groups and of Chalopin et al. (2020) for Helly groups, to show that the CB-groups are biautomatic.
Recommendations
Cites work
- 1-Hyperbolic Graphs
- A Helly theorem in weakly modular space
- Almost convex groups
- Automatic structures, rational growth, and geometrically finite hyperbolic groups
- Boundaries of systolic groups.
- Bridged graphs are cop-win graphs: An algorithmic proof
- Bucolic complexes
- Classifying spaces for families of subgroups for systolic groups
- Combinatorial group theory.
- Connectedness at infinity of systolic complexes and groups.
- Contractibility of the Kakimizu complex and symmetric Seifert surfaces
- Dismantlability of weakly systolic complexes and applications
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Filling invariants of systolic complexes and groups.
- Finiteness and the falsification by fellow traveler property.
- Flats and the flat torus theorem in systolic spaces.
- Geodetic graphs of diameter two
- Geodetic graphs of diameter two
- Graphs of some CAT(0) complexes
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 26592 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Isometries of systolic spaces
- Large-type Artin groups are systolic
- Metric graph theory and geometry: a survey
- Metric systolicity and two-dimensional Artin groups
- On bridged graphs and cop-win graphs
- On infinite bridged graphs and strongly dismantlable graphs
- On isometric subgraphs of infinite bridged graphs and geodesic convexity
- On local convexity in graphs
- On Moore Graphs with Diameters 2 and 3
- On two conjectures of maurer concerning basis graphs of matroids
- Regular path systems and (bi)automatic groups.
- Shortcut graphs and groups
- Simplicial nonpositive curvature
- Systolic complexes and group presentations
- Systolic groups acting on complexes with no flats are word-hyperbolic
- The fixed point theorem for simplicial nonpositive curvature
- Weakly Modular Graphs and Nonpositive Curvature
Cited in
(7)- Arranging solid balls to represent a graph
- scientific article; zbMATH DE number 5139432 (Why is no real title available?)
- scientific article; zbMATH DE number 1185583 (Why is no real title available?)
- Convex-Round and Concave-Round Graphs
- First-order logic axiomatization of metric graph theory
- Can you tell a tree from its branches?
- On all-path convex, gated and Chebyshev sets in graphs
This page was built for publication: Graphs with convex balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163405)