A Tverberg-type result on multicolored simplices
Author:
- János PachJPJános Pach
Preprint
Abstract
Let $P_1, P_2,\ldots, P_{d+1}$ be pairwise disjoint $n$-element point sets in general position in $d$-space. It is shown that there exist a point $O$ and suitable subsets $Q_i\subseteq P_i \; (i=1, 2, \ldots, d+1)$ such that $|Q_i|\geq c_d|P_i|$, and every $d$-dimensional simplex with exactly one vertex in each $Q_i$ contains $O$ in its interior. Here $c_d$ is a positive constant depending only on $d$.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Bounding the Number of Geometric Permutations Induced byk-TransversalsJournal of Combinatorial Theory, Series A, 1996
- The Uniformity Lemma for hypergraphsGraphs and Combinatorics, 1992
- The colored Tverberg's problem and complexes of injective functionsJournal of Combinatorial Theory, Series A, 1992
- Point Selections and Weak ε-Nets for Convex HullsCombinatorics, Probability and Computing, 1992
- A Colored Version of Tverberg's TheoremJournal of the London Mathematical Society, 1992
- Regularity lemmas for hypergraphs and quasi‐randomnessRandom Structures & Algorithms, 1991
- On the number of halving planesCombinatorica, 1990
- Intersection patterns of convex setsIsrael Journal of Mathematics, 1984
- Mengen konvexer K rper, die einen gemeinsamen Punkt enthaltenMathematische Annalen, 1921