Complete Kneser transversals
From MaRDI portal
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Oriented matroids in discrete geometry (52C40) Coloring of graphs and hypergraphs (05C15) Helly-type theorems and geometric transversal theory (52A35) Polytopes and polyhedra (52B99)
Abstract: Let be integers with . Let be the maximum positive integer such that every set of points (not necessarily in general position) in has the property that the convex hulls of all -sets have a common transversal -plane. It turns out that is strongly connected with other interesting problems, for instance, the chromatic number of Kneser hypergraphs and a discrete version of Rado's centerpoint theorem. In the same spirit, we introduce a natural discrete version of by considering the existence of complete Kneser transversals. We study the relation between them and give a number of lower and upper bounds of as well as the exact value in some cases. The main ingredient for the proofs are Radon's partition theorem as well as oriented matroids tools. By studying the alternating oriented matroid we obtain the asymptotic behavior of the function for the family of cyclic polytopes.
Recommendations
Cites work
Cited in
(4)
This page was built for publication: Complete Kneser transversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335860)