A Helly theorem in weakly modular space

DOI10.1016/0012-365X(95)00217-KzbMath0864.05049MaRDI QIDQ1126279

Victor Chepoi, Hans-Jürgen Bandelt

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

interval spaceclique numberHelly numberHelly theoremweakly modular space

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Separation of two convex sets in convexity structures, Intervals and steps in a connected graph, The interval function of a connected graph and road systems, The algebra of metric betweenness. I: Subdirect representation and retraction, A note on \(r\)-dominating cliques, On bipartite graphs whose interval space is a closed join space, Quasi‐median graphs and algebras, Bucolic complexes, Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs, Graphs with \(G^p\)-connected medians, The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs, Graphs with convex balls, First-order logic axiomatization of metric graph theory, Weak modularity and \(\widetilde{A}_n\) Coxeter groups, Finding a central vertex in an HHD-free graph, Graphs of some CAT(0) complexes, Helly theorems for 3-Steiner and 3-monophonic convexity in graphs, Retracts of Products of Chordal Graphs, On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays, A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph, Weakly Modular Graphs and Nonpositive Curvature, Triangle path transit functions, betweenness and pseudo-modular graphs, Condorcet domains, median graphs and the single-crossing property, Dismantlability of weakly systolic complexes and applications, Metrics with finite sets of primitive extensions, A classification of the six-point prime metrics, 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
• A dynamic location problem for graphs
• A Helly theorem for convexity in graphs
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• Networks with Condorcet solutions
• Distance-hereditary graphs
• Pseudo-modular graphs
• On local convexity in graphs
• On bridged graphs and cop-win graphs
• Isometric embeddings in Hamming graphs
• Convex sets in graphs. II: Minimal path convexity
• Partition numbers for trees and ordered sets
• Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
• The retracts of Hamming graphs
• Median algebras
• Vertex-to-vertex pursuit in a graph
• Ternary spaces, media, and Chebyshev sets
• Conditions for invariance of set diameters under d-convexification in a graph
• Modular Interval Spaces
• Products of absolute retracts