Péter L. Erdős

11.7k citations
187 papers · 5.1k · 1 hit paper · h-index 31

Impact in

Papers in

Péter L. Erdős

179 papers receiving 4.5k citations

Péter L. Erdős's Hit Papers

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS 1961 · 830 citations
8300+21+43Years since publication250500750

Peers

Péter L. Erdős
Comparison fields: 5 of 119
  • Discrete Mathematics and Combinatorics 2.9k
  • Geometry and Topology 2.0k
  • Computational Theory and Mathematics 2.9k
  • Algebra and Number Theory 480
  • Mathematical Physics 406
Replace J. H. van Lint with:
J. H. van Lint Netherlands
Endre Szemerédi United States
Günter M. Ziegler Germany
P. Erdös Hungary
Péter Frankl Hungary
Richard A. Brualdi United States
J. W. Moon Canada
Brendan D. McKay Australia
Vera T. Sós Hungary
W. T. Tutte Canada
Péter L. Erdős relative to J. H. van Lint Netherlands J. H. van Lint's profile →
Citations per field
00.5×2.6×
J. H. van Lint · 1×
Citations per year

Countries citing papers authored by Péter L. Erdős

Since Specialization
Citations

This map shows the geographic impact of Péter L. Erdős's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Péter L. Erdős with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Péter L. Erdős more than expected).

Fields of papers citing papers by Péter L. Erdős

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Péter L. Erdős. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Péter L. Erdős. The network helps show where Péter L. Erdős may publish in the future.

Co-authors

The 25 scholars most cited alongside Péter L. Erdős, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Péter L. Erdős Line = papers co-authored together Péter L. Erdős links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 187 papers — load more, or switch the sort, to bring in the rest.

#Work
1
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Hit paper breakdown →
1961830
2 1964387
3 1966245
4 1956228
5 1965165
6 1951160
7 1963155
8 1973154
9 1986151
10 1956127
11 1978114
12 1967105
13 198291
14 196481
15 197279
16 199978
17
On the Central Limit Theorem for Samples from a Finite Population
195974
18 199166
19 199563
20
ON GRAPHS OF RAMSEY TYPE
197660

About Péter L. Erdős

Péter L. Erdős is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Mathematical Physics and Algebra and Number Theory, having authored 187 papers that have together received 5.1k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (57 papers), Advanced Graph Theory Research (50 papers), Graph theory and applications (27 papers), Advanced Topology and Set Theory (24 papers), Analytic Number Theory Research (23 papers), graph theory and CDMA systems (19 papers), Graph Labeling and Dimension Problems (18 papers) and semigroups and automata theory (13 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (2.9k citations), Geometry and Topology (2.0k citations), Computational Theory and Mathematics (2.9k citations), Algebra and Number Theory (480 citations) and Mathematical Physics (406 citations). Péter L. Erdős has collaborated with scholars based in Hungary, United States and Germany. Frequent co-authors include R. Rado, A. Hajnal, Chao Ko, Péter Frankl, N.G. de Bruijn, A. Rényi, J. L. Selfridge, Łászló A. Székely, D. A. Darling and V. Rödl. Their work appears in journals such as Discrete Mathematics, COMBINATORICA, Journal of the London Mathematical Society, Acta Arithmetica and Discrete Applied Mathematics.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact