The different ways of stabbing disjoint convex sets
From MaRDI portal
Publication:1184163
DOI10.1007/BF02187836zbMath0748.52006MaRDI QIDQ1184163
Publication date: 28 June 1992
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131191
05A99: Enumerative combinatorics
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Cites Work
- Unnamed Item
- Upper bounds on geometric permutations for convex sets
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
- On common transversals
- Geometric permutations and common transversals
- Geometric permutations of disjoint translates of convex sets
- Proof of Grünbaum's conjecture on common transversals for translates
- Geometric permutations for convex sets
- A conjecture of Grünbaum on common transversals.