Tverberg's Theorem
Tverberg's Theorem is a fundamental result in topological combinatorics that asserts any set of at least $(d+1)(r-1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ disjoint subsets whose convex hulls have nonempty intersection, thereby generalizing Radon's Theorem and establishing a cornerstone in the study of intersection patterns of convex sets.
44
Publications
1.7K
Citations
45
Authors
44
Institutions
Publications per year
2017–2026
6
Parents
44
On a topological generalization of the Tverberg theorem
A Yu Volovikov · Mathematical Notes · 1996 · 92 citations
1–5 of 44
45
7
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 45
44
Freie Universität Berlin
Berlin, Germany
7 h-index
12 publications
342 citations
Technische Universität Berlin
Berlin, Germany
5 h-index
6 publications
173 citations
University College London
London, United Kingdom
3 h-index
5 publications
212 citations
University of Illinois Chicago
Chicago, United States
2 h-index
2 publications
30 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
2 publications
243 citations

Serbian Academy of Sciences and Arts
Belgrade, Serbia
2 h-index
4 publications
131 citations

Western Washington University
Bellingham, United States
2 h-index
2 publications
47 citations
Northeastern University
Boston, United States
2 h-index
2 publications
26 citations
1–8 of 44
6 publications · 105 citations
6
h-index
Repository · 4 publications · 102 citations
4
h-index
3 publications · 61 citations
3
h-index
3 publications · 118 citations
3
h-index
2 publications · 155 citations
2
h-index
1–5