Ramsey Intersections is a combinatorial framework in Ramsey Theory that characterizes the unavoidable intersection patterns of infinite sets under finite colorings, distinguished by its focus on structural regularity in set systems arising from Ramsey-type partition theorems.
10
Publications
414
Citations
18
Authors
22
Institutions
Publications per year
2017–2026
1
Parents
Publications
10
Ramsey-Type Results for Geometric Graphs, I
Gyula Károlyi, János Pach, Gézá Tóth · Discrete & Computational Geometry · 1997 · 68 citations · Full text
1–5 of 10
Authors
18
- JP
3
h-index
- GT
2
h-index
- JG
1
h-index
- BS
1
h-index
- KW
1
h-index
1–5 of 18
Institutions
22
Eötvös Loránd University
Budapest, Hungary
3 h-index
3 publications
181 citations
City College of New York
New York, United States
3 h-index
3 publications
144 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
2 publications
88 citations
Charles University
Prague, Czechia
2 h-index
3 publications
134 citations
University College London
London, United Kingdom
1 h-index
1 publications
56 citations
Czech Technical University in Prague
Prague, Czechia
1 h-index
2 publications
114 citations
Institute for Advanced Study
Princeton, United States
1 h-index
1 publications
68 citations
University of Michigan
Ann Arbor, United States
1 h-index
1 publications
13 citations
1–8 of 22
Venues
- Discrete & Computational Geometry
2 publications · 88 citations
2
h-index
- Journal of Combinatorial Theory
1 publications · 21 citations
1
h-index
- Archive for Mathematical Logic
1 publications · 12 citations
1
h-index
- Bulletin of the London Mathematical Society
1 publications · 56 citations
1
h-index
- Advances in Mathematics
1 publications · 51 citations
1
h-index
1–5