Intersection Theorems

Intersection Theorems is a mathematical framework within extremal combinatorics that characterizes the maximum size or structure of set systems under the constraint that any two subsets intersect in at least a specified number of elements.

700

Publications

33.8K

Citations

981

Authors

511

Institutions

Publications per year

2017–2026

53

Variants

Intersection Theorems In Combinatorics

Authors

981

  1. PF
    Péter Frankl

    Centre National de la Recherche Scientifique, France

    28 publications · 1.9K citations

    18

    h-index

  2. NT
    Norihide Tokushige

    University of the Ryukyus, Japan

    13 publications · 336 citations

    11

    h-index

  3. PB
    Peter Borg

    University of Malta, Malta

    10 publications · 277 citations

    10

    h-index

  4. ZF
    Zoltán Füredi

    Hungarian Academy of Sciences, Hungary

    7 publications · 289 citations

    7

    h-index

  5. JP
    János Pach

    Hungarian Academy of Sciences, Hungary

    7 publications · 293 citations

    7

    h-index

1–5 of 981

Venues

  1. Journal of Combinatorial Theory Series A

    53 publications · 2.3K citations

    26

    h-index

  2. Discrete Mathematics

    25 publications · 665 citations

    15

    h-index

  3. Journal of Algebra

    15 publications · 559 citations

    14

    h-index

  4. European Journal of Combinatorics

    23 publications · 966 citations

    14

    h-index

  5. Journal of the London Mathematical Society

    15 publications · 1.2K citations

    13

    h-index

1–5