A Tverberg-type result on multicolored simplices

DOI10.1016/S0925-7721(97)00022-9zbMATH Open0896.68143arXivmath/9603211OpenAlexW1994366967MaRDI QIDQ1388134FDOQ1388134

Authors: János Pach 

Publication date: 8 June 1998

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

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$.

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

Recommendations

• A Colored Version of Tverberg's Theorem
• More colourful simplices
• Note on the colored Tverberg theorem

zbMATH Keywords

multicolored simplices

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (24)

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

This page was built for publication: A Tverberg-type result on multicolored simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388134)