References
H.-J.Bandelt and H. M.Mulder, Helly theorems for dismantlable graphs and pseudo-modular graphs. Submitted.
H.-J.Bandelt and E.Pesch, Dismantling absolute retracts of reflexive graphs. European J. Combin., to appear.
V. D. Čepoj, Some properties of thed-convexity in triangulated graphs (in Russian). Mat. Issled.87, 164–177 (1986).
P.Duchet, Convex sets in graphs II: minimal path convexity. J. Combin. Theory Ser. B, to appear.
J.Eckhoff, Radon's theorem revisited. In: Contributions to geometry, 164–185, Basel-Boston 1979.
R. E. Jamison, Partition numbers for trees and ordered sets. Pacific J. Math.96, 115–140 (1981).
E. M. Jawhari, D. Misane andM. Pouzet, Retracts: graphs and ordered sets from the metric point of view. In: Combinatorics and ordered sets, Contemp. Math.57, 175–226 (Amer. Math. Soc., 1986).
R. Nowakowski andI. Rival, The smallest graph variety containing all paths. Discrete Math.43, 223–234 (1983).
E. Pesch, Minimal extensions of graphs to absolute retracts. J. Graph Theory11, 585–598 (1987).
A.Quilliot, Homomorphismes, points fixes, rétractions et jeux de poursuite dans les graphes, les ensembles ordonnés et les espaces métriques. Thèse de Doctorat d'Etat, Paris 1983.
A. Quilliot, On the Helly property working as a compactness criterion on graphs. J. Combin. Theory Ser. A40, 186–193 (1985).
H. Tverberg, A generalisation of Radon's theorem. J. London Math. Soc.41, 123–128 (1966).
M. van de Vel, Finite dimensional convex structures II: the invariants. Topology Appl.16, 81–105 (1983).
M. van de Vel, Matching binary convexities. Topology Appl.16, 207–235 (1983).
M.van de Vel, Abstract, topological, and uniform convex structures. Rapportnr.325, Vrije Universiteit Amsterdam, Fac. W. enI, 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bandelt, H.J., Pesch, E. A Radon theorem for Helly graphs. Arch. Math 52, 95–98 (1989). https://doi.org/10.1007/BF01197978
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01197978