Weakly Modular Graphs and Nonpositive Curvature

DOI10.1090/memo/1309zbMath1475.05001arXiv1409.3892OpenAlexW1706395838MaRDI QIDQ3380549

Jérémie Chalopin, Hiroshi Hirai, Victor Chepoi, Damian Osajda

Publication date: 29 September 2021

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

latticecombinatorial optimizationCAT(0) spacegroup actionincidence geometrynonpositive curvaturebuildingdual polar graphsweakly modular graphHelly graphsorthoscheme complexpre-median graphssweakly modular graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial optimization (90C27) Topological methods in group theory (57M07) Distance in graphs (05C12) Hyperbolic groups and nonpositively curved groups (20F67) General theory of distance geometry (51K05)

Related Items (20)

Medians in median graphs and their cube complexes in linear time ⋮ Morse quasiflats. I ⋮ Mini-workshop: Nonpositively curved complexes. Abstracts from the mini-workshop held February 7--13, 2021 (online meeting) ⋮ Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- ⋮ Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs ⋮ Old and new challenges in Hadamard spaces ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ Graphical complexes of groups ⋮ Uniform modular lattices and affine buildings ⋮ Graphs with convex balls ⋮ First-order logic axiomatization of metric graph theory ⋮ Weak modularity and \(\widetilde{A}_n\) Coxeter groups ⋮ A nonpositive curvature property of modular semilattices ⋮ To Approximate Treewidth, Use Treelength! ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ Helly meets Garside and Artin ⋮ Self-contracted curves in CAT(0)-spaces and their rectifiability ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 6-strand braid group is \(\mathrm{CAT}(0)\).
• The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning).
• Bucolic complexes
• On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
• Braids, posets and orthoschemes
• Geodesics in CAT(0) cubical complexes
• Median graphs, parallelism and posets
• Points and lines. Characterizing the classical geometries
• Shortest path problem in rectangular complexes of global nonpositive curvature
• Extension of uniformly continuous transformations and hyperconvex metric spaces
• Clique graphs and Helly graphs
• Simplicial nonpositive curvature
• Basis graphs of even delta-matroids
• Gated sets in metric spaces
• Kazhdan and Haagerup properties from the median viewpoint.
• The structure of near polygons with quads
• Local recognition of Tits geometries of classical type
• Pseudo-modular graphs
• On local convexity in graphs
• Combinatorial geometries, convex polyhedra, and Schubert cells
• Hereditary modular graphs
• Dismantling absolute retracts of reflexive graphs
• A Helly theorem in weakly modular space
• Products of trees, lattices and simple groups
• Near \(n\)-gons and line systems
• Dual polar spaces
• Superextensions and the depth of median graphs
• Convergence of iterated clique graphs
• On scale embeddings of graphs into hypercubes
• Buildings of spherical type and finite BN-pairs
• Metrics with finite sets of primitive extensions
• Bridged graphs are cop-win graphs: An algorithmic proof
• Minimum 0-extensions of graph metrics
• The geometry of cube complexes and the complexity of their fundamental groups
• Fiber-complemented graphs. II: Retractions and endomorphisms
• The structure of spherical graphs.
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Combinatorial group theory.
• Fiber-complemented graphs. I: Structure and invariant subgraphs
• Cubulating small cancellation groups.
• Strongly geodesically automatic groups are hyperbolic
• A multifacility location problem on median spaces
• A construction of hyperbolic Coxeter groups.
• On infinite bridged graphs and strongly dismantlable graphs
• Graphs of some CAT(0) complexes
• Combing Euclidean buildings.
• On two conjectures of maurer concerning basis graphs of matroids
• One more well-solved case of the multifacility location problem
• Special cube complexes
• Regular path systems and (bi)automatic groups.
• Six theorems about injective metric spaces
• Matroid basis graphs. I
• Matroid basis graphs. II
• Word problems. Decision problems and the Burnside problem in group theory
• Contractibility of the Kakimizu complex and symmetric Seifert surfaces
• Combinatorial negative curvature and triangulations of 3-manifolds
• Foundations of Incidence Geometry
• Absolute Retracts and Varieties of Reflexive Graphs
• Nice Labeling Problem for Event Structures: A Counterexample
• Lattice Theory: Foundation
• Folder Complexes and Multiflow Combinatorial Dualities
• Retracts of hypercubes
• Approximation algorithms for classification problems with pairwise relationships
• Buildings
• On Earthmover Distance, Metric Labeling, and 0-Extension
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
• An Injective Metrization for Collapsible Polyhedra
• Conditions for invariance of set diameters under d-convexification in a graph
• On Isometric Embeddings of Graphs
• Median Algebra
• On Distance-Preserving and Domination Elimination Orderings
• Collapsible polyhedra and median spaces
• Modular Interval Spaces
• The Complexity of Multiterminal Cuts
• Quasi‐median graphs and algebras
• Ends of Group Pairs and Non-Positively Curved Cube Complexes
• Cop and Robber Game and Hyperbolicity
• The complexity of satisfiability problems
• Dismantlability of weakly systolic complexes and applications
• Geometry of cuts and metrics
• Convexity and fixed-point properties in Helly graphs
• Discrete convexity and polynomial solvability in minimum 0-extension problems

This page was built for publication: Weakly Modular Graphs and Nonpositive Curvature