A Radon theorem for Helly graphs

DOI10.1007/BF01197978zbMath0677.52001OpenAlexW2011311765WikidataQ56503422 ScholiaQ56503422MaRDI QIDQ1123404

Hans-Jürgen Bandelt, Erwin Pesch

Publication date: 1989

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01197978

zbMATH Keywords

Helly graphRadon numberconvexity spaceEckhoff's conjectureTverberg number

Mathematics Subject Classification ID

Axiomatic and generalized convexity (52A01) Graph theory (05C99) Helly-type theorems and geometric transversal theory (52A35)

Related Items (6)

Tverberg numbers for cellular bipartite graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ An upper bound on the \(P_3\)-Radon number ⋮ Helly theorems for 3-Steiner and 3-monophonic convexity in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite dimensional convex structures. II: The invariants
• Matching binary convexities
• On the Helly property working as a compactness criterion on graphs
• Convex sets in graphs. II: Minimal path convexity
• Dismantling absolute retracts of reflexive graphs
• Partition numbers for trees and ordered sets
• The smallest graph variety containing all paths
• Minimal extensions of graphs to absolute retracts
• A Generalization of Radon's Theorem

This page was built for publication: A Radon theorem for Helly graphs