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
700
The Complexity of Intersectionality
Leslie McCall · Signs · 2005 · 6.5K citations
Power Diagrams: Properties, Algorithms and Applications
Franz Aurenhammer · SIAM Journal on Computing · 1987 · 831 citations
Intersection Theorems for Systems of Sets
P. Erdös, R. Rado · Journal of the London Mathematical Society · 1960 · 638 citations
1–5 of 700
981
18
h-index
11
h-index
10
h-index
7
h-index
7
h-index
1–5 of 981
511

Hungarian Academy of Sciences
Budapest, Hungary
16 h-index
22 publications
2.4K citations

Eötvös Loránd University
Budapest, Hungary
16 h-index
25 publications
1.2K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
26 publications
1K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
15 publications
635 citations
Princeton University
Princeton, United States
13 h-index
16 publications
2K citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
11 h-index
16 publications
398 citations

University of Waterloo
Waterloo, Canada
10 h-index
15 publications
625 citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
14 publications
388 citations
1–8 of 511
53 publications · 2.3K citations
26
h-index
25 publications · 665 citations
15
h-index
15 publications · 559 citations
14
h-index
23 publications · 966 citations
14
h-index
15 publications · 1.2K citations
13
h-index
1–5