P. Erdös

25.4k citations
378 papers · 11.9k · 4 hit papers · h-index 52

Impact in

Papers in

P. Erdös

364 papers receiving 10.5k citations

P. Erdös's Hit Papers

A Combinatorial Problem in Geometry 2009 · 391 citations
3910+22+44Years since publication100200300400500

Peers

P. Erdös
Comparison fields: 5 of 145
  • Discrete Mathematics and Combinatorics 5.8k
  • Geometry and Topology 4.5k
  • Computational Theory and Mathematics 7.0k
  • Algebra and Number Theory 1.4k
  • Computer Graphics and Computer-Aided Design 781
Replace Péter L. Erdős with:
Péter L. Erdős Hungary
Richard P. Stanley United States
Bernd Sturmfels United States
Günter M. Ziegler Germany
Endre Szemerédi United States
W. T. Tutte Canada
Philippe Flajolet France
Noga Alon Israel
Joel Spencer United States
Victor Klee United States
P. Erdös relative to Péter L. Erdős Hungary Péter L. Erdős's profile →
Citations per field
00.5×2.7×
Péter L. Erdős · 1×
Citations per year

Countries citing papers authored by P. Erdös

Since Specialization
Citations

This map shows the geographic impact of P. 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. 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. Erdös more than expected).

Fields of papers citing papers by P. Erdös

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by P. 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. Erdös. The network helps show where P. Erdös may publish in the future.

Co-authors

The 25 scholars most cited alongside P. 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. Erdös Line = papers co-authored together P. 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 378 papers — load more, or switch the sort, to bring in the rest.

#Work
1
On the strength of connectedness of a random graph
Hit paper breakdown →
1964546
2
On maximal paths and circuits of graphs
Hit paper breakdown →
1959528
3
Graphs of Extremal Weights.
1998452
4
A note on Hamiltonian circuits
Hit paper breakdown →
1972419
5 1960394
6
A Combinatorial Problem in Geometry
Hit paper breakdown →
2009391
7 1985347
8 1970267
9
Old and new problems and results in combinatorial number theory
1980263
10 1964250
11
Combinatorial theory and its applications
1970215
12 1966205
13 1970203
14 1976202
15 2009201
16 1963193
17
Graphs with prescribed degree of vertices
1960184
18 1981172
19 1952163
20 1952150

About P. Erdös

P. Erdös is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Algebra and Number Theory and Mathematical Physics, having authored 378 papers that have together received 11.9k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (131 papers), Advanced Graph Theory Research (101 papers), Analytic Number Theory Research (72 papers), Graph Labeling and Dimension Problems (63 papers), Graph theory and applications (48 papers), graph theory and CDMA systems (45 papers), Advanced Topology and Set Theory (42 papers) and Mathematics and Applications (36 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (5.8k citations), Geometry and Topology (4.5k citations), Computational Theory and Mathematics (7.0k citations), Algebra and Number Theory (1.4k citations) and Computer Graphics and Computer-Aided Design (781 citations). P. Erdös has collaborated with scholars based in Hungary, United States and United Kingdom. Frequent co-authors include A. Rényi, Béla Bollobás, R. Rado, Т. Галлаи, Vašek Chvátal, Ronald Graham, Zoltán Füredi, Vera T. Sós, B Bollobás and Péter Frankl. Their work appears in journals such as Discrete Mathematics, Acta Arithmetica, Journal of Number Theory, Journal of the London Mathematical Society and Israel Journal of 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