Geometric permutations of disjoint translates of convex sets
Discrete Mathematics
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n - 2
Discrete & Computational Geometry
Discrete & Computational Geometry
The different ways of stabbing disjoint convex sets
Discrete & Computational Geometry
Helly-type theorems and geometric transversals
Handbook of discrete and computational geometry
Geometric permutations of high dimensional spheres
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The triples of geometric permutations for families of disjoint translates
Discrete Mathematics
Forbidden Families of Geometric Permutations in ℝd
Discrete & Computational Geometry
Multinerves and helly numbers of acyclic families
Proceedings of the twenty-eighth annual symposium on Computational geometry
Improved Bounds for Geometric Permutations
SIAM Journal on Computing
Set systems and families of permutations with small traces
European Journal of Combinatorics
| Hi-index | 0.00 |
We show that a set of n disjoint unit spheres in R^d admits at most two distinct geometric permutations if n=9, and at most three if 3=