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

Authors

45

  1. GM
    Günter M. Ziegler

    Technische Universität Berlin, Germany

    8 publications · 318 citations

    7

    h-index

  2. PS
    Pablo Soberón

    Northeastern University, United States

    5 publications · 90 citations

    5

    h-index

  3. UW
    Uli Wagner

    ETH Zurich, Switzerland

    4 publications · 88 citations

    4

    h-index

  4. PV
    Pavle V. M. Blagojević

    Freie Universität Berlin, Germany

    5 publications · 182 citations

    4

    h-index

  5. IB
    Imre Bárány

    Hungarian Academy of Sciences, Hungary

    3 publications · 280 citations

    3

    h-index

1–5 of 45

Venues

  1. Discrete & Computational Geometry

    6 publications · 105 citations

    6

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 102 citations

    4

    h-index

  3. European Journal of Combinatorics

    3 publications · 61 citations

    3

    h-index

  4. Israel Journal of Mathematics

    3 publications · 118 citations

    3

    h-index

  5. Pacific Journal of Mathematics

    2 publications · 155 citations

    2

    h-index

1–5