A Tverberg-type result on multicolored simplices
Author:
- János PachJPJános Pach
Open Access
- 1 May 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 10 (2) , 71-76
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 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
- 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
- A Generalization of Radon's TheoremJournal of the London Mathematical Society, 1966
- Drei Sätze über die n-dimensionale euklidische SphäreFundamenta Mathematicae, 1933
- Mengen konvexer K rper, die einen gemeinsamen Punkt enthaltenMathematische Annalen, 1921