A Tverberg-type result on multicolored simplices

DOI10.1016/S0925-7721(97)00022-9zbMath0896.68143arXivmath/9603211OpenAlexW1994366967MaRDI QIDQ1388134

János Pach

Publication date: 8 June 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9603211

zbMATH Keywords

multicolored simplices

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Overlap properties of geometric expanders, Helly-type theorems for the diameter, Isoperimetric inequalities in simplicial complexes, Carathéodory's theorem in depth, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem, On a topological version of Pach's overlap theorem, Finite quotients of Bruhat–Tits buildings as geometric expanders, Mixing in High-Dimensional Expanders, Homogeneous selections from hyperplanes, Local spectral expansion approach to high dimensional expanders. II: Mixing and geometrical overlapping, Ramanujan complexes and high dimensional expanders, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Pach's selection theorem does not admit a topological extension, Positive-fraction intersection results and variations of weak epsilon-nets, Non-representability of finite projective planes by convex sets, Quantitative \((p, q)\) theorems in combinatorial geometry, Tverberg’s theorem is 50 years old: A survey, Bounds for Pach's selection theorem and for the minimum solid angle in a simplex, Hypergraph expanders from Cayley graphs, Tverberg theorems over discrete sets of points, Helly-type problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
• The colored Tverberg's problem and complexes of injective functions
• The uniformity lemma for hypergraphs
• Bounding the number of geometric permutations induced by \(k\)-transversals
• On the number of halving planes
• A Problem of Geometry in R n
• Regularity lemmas for hypergraphs and quasi-randomness
• A Colored Version of Tverberg's Theorem
• Point Selections and Weak ε-Nets for Convex Hulls
• A Generalization of Radon's Theorem