The Radon-split and the Helly-core of a point configuration

DOI10.1007/s00022-001-8577-xzbMath1001.52001OpenAlexW1970619848MaRDI QIDQ1601383

Shmuel Onn

Publication date: 16 December 2002

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-001-8577-x

zbMATH Keywords

computational complexitymatchinggraph coloringpolytopecoreabstract convexityPetersen graphsplitRadon partitionTverberg theoremfour color theoremconvexity spacepoint configurationHelly theoremRadon theorem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Axiomatic and generalized convexity (52A01) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Helly-type theorems and geometric transversal theory (52A35) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes ⋮ Helly-type problems

This page was built for publication: The Radon-split and the Helly-core of a point configuration