Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. J. L. Arocha, I. Bárány, J. Bracho, R. Fabila and L. Montejano: Very Colorful Theorems, Discrete & Computational Geometry 42 (2009), 142–154.
2. I. Bárány: Tensors, colours, octahedra, to appear in Geometry, Structure and Randomness in Combinatorics, CRM Monograph Series.
3. I. Bárány: A generalization of Carathéodory’s theorem, Discrete Mathematics 40 (1982), 141–152.
4. I. Bárány, Z. Füredi and L. Lovász: On the number of halving planes, Combinatorica 10 (1990), 175–183.
5. I. Bárány and D. G. Larman: A colored version of Tverberg’s theorem, Journal of the London Mathematical Society 2 (1992), 3–4.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tverberg's theorem and multi-class support vector machines;Foundations of Data Science;2024
2. Transversal Generalizations of Hyperplane Equipartitions;International Mathematics Research Notices;2023-09-25
3. The Crossing Tverberg Theorem;Discrete & Computational Geometry;2023-07-27
4. Tolerance for colorful Tverberg partitions;European Journal of Combinatorics;2022-06
5. No-Dimensional Tverberg Theorems and Algorithms;Discrete & Computational Geometry;2022-04-12