scientific article; zbMATH DE number 3696004
From MaRDI portal
Publication:3889702
Cited in
(20)- On Eckhoff's conjecture for Radon numbers; or how far the proof is still away
- The minimal number of circuits in a finite set in \(R^{2k-1}\)
- An axiomatic of non-Radon partitions of oriented matroids
- Convex sets in graphs. II: Minimal path convexity
- A Radon theorem for Helly graphs
- Extensions of set partitions
- Minimum numbers of circuits in affine sets
- Generalized Radon partitions in convexity spaces
- Problems on discrete metric spaces
- Density and dimension
- Total polynomials of uniform oriented matroids
- Topes of oriented matroids and related structures
- Radon numbers grow linearly
- scientific article; zbMATH DE number 3710919 (Why is no real title available?)
- A generalisation of Tverberg's theorem
- Tverberg’s theorem is 50 years old: A survey
- Helly-type problems
- Dimension of the Radon set
- A refinement of the Sylvester problem: probabilities of combinatorial types
- A Helly theorem for convexity in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3889702)