P. Erdös
- Discrete Mathematics and Combinatorics top 0.01%
- Limits and Structures in Graph Theory 119
- Geometry and Topology top 0.02%
- Graph theory and applications 45
- Advanced Topology and Set Theory 38
- Mathematics and Applications 32
- Computational Theory and Mathematics top 0.02%
- Advanced Graph Theory Research 91
- Graph Labeling and Dimension Problems 56
- Algebra and Number Theory top 0.5%
- Analytic Number Theory Research 63
-
- graph theory and CDMA systems 38
P. Erdös
317 papers receiving 8.2k citations
Hit Papers
Peers
Comparison fields: 5 of 138
- Discrete Mathematics and Combinatorics 4.6k
- Geometry and Topology 3.7k
- Computational Theory and Mathematics 5.6k
- Algebra and Number Theory 1.1k
- Computer Graphics and Computer-Aided Design 496
Countries citing papers authored by P. Erdös
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
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-authorship network
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.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Graphs of Extremal Weights. | 1998 | 445 |
| 2 | On partitions of lines and space | 1994 | 8 |
| 3 | In memory of Tibor Gallai. | 1992 | 1 |
| 4 | Small transversals in uniform hypergraphs | 1992 | 5 |
| 5 | On some of my favourite problems in graph theory and block designs | 1991 | 9 |
| 6 | 1988 | 22 | |
| 7 | Some diophantine equations with many solutions | 1988 | 27 |
| 8 | 1987 | 6 | |
| 9 | 1979 | 7 | |
| 10 | 1976 | 162 | |
| 11 | Über die Zahlen der Form ...(n) - n und n - ...(n). | 1973 | 3 |
| 12 | Résultats et problèmes en théorie des nombres | 1973 | 1 |
| 13 | Theory of graphs : proceedings of the colloquium, held at Tihany, Hungary, September, 1966 | 1968 | 6 |
| 14 | 1966 | 4 | |
| 15 | 1965 | 36 | |
| 16 | 1964 | 15 | |
| 17 | 1963 | 55 | |
| 18 | On a recursion formula and some Tauberian theorems | 1953 | 10 |
| 19 | 1952 | 149 | |
| 20 | 1951 | 19 |
About P. Erdös
P. Erdös is a scholar working on Discrete Mathematics and Combinatorics, Theoretical Computer Science, Algebra and Number Theory, Geometry and Topology and Computational Theory and Mathematics, having authored 338 papers that have together received 9.4k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (119 papers), Advanced Graph Theory Research (91 papers), Analytic Number Theory Research (63 papers), Graph Labeling and Dimension Problems (56 papers), Graph theory and applications (45 papers), Advanced Topology and Set Theory (38 papers), graph theory and CDMA systems (38 papers) and Mathematics and Applications (32 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (4.6k citations), Geometry and Topology (3.7k citations), Computational Theory and Mathematics (5.6k citations), Algebra and Number Theory (1.1k citations) and Computer Graphics and Computer-Aided Design (496 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, Vera T. Sós, Leo Moser, Zoltán Füredi and Joel Spencer. Their work appears in journals such as Discrete Mathematics, Acta Arithmetica, Journal of the London Mathematical Society, Journal of Number Theory 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.