Dismantlability of weakly systolic complexes and applications
By Victor Chepoi, Damian Osajda. 2009
55 citations recorded by the source corpus.
In this paper, we investigate the structural properties of weakly systolic complexes introduced recently by the second author and of their 1-skeletons, the weakly bridged graphs. We present several characterizations of weakly systolic complexes and weakly bridged graphs. Then we prove that weakly bridged graphs are dismantlable. Using this, we establish the fixed point theorem for weakly systolic complexes. As a consequence, we get results about conjugacy classes of finite subgroups and classifying spaces for finite subgroups of weakly systolic groups. As immediate corollaries, we obtain new results on systolic complexes and
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/af34364f81281943d3b56ae6f0bc40d50d5e742b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Geometry and Topology
In Mathematical Physics
Citations in the corpus
- Weakly Modular Graphs and Nonpositive Curvature (2014, background): “ A graph Gis weakly bridged [CO14,Osa13a] if Gis a weakly modular graph with convex balls Br(x;G):Equivalently, weakly bridged graphs are exactly the weakly modular graphs without induced 4{cycles C4 [CO14]. 4. Pre-median graphs. A graph Gis called pre-median [Cha01,Cha03] (pm-graph, for short) if G”