- Home
- Top Scientists - Mathematics
- Paul Erdös

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Mathematics
H-index
95
Citations
54,910
551
World Ranking
25
National Ranking
2

Engineering and Technology
H-index
76
Citations
43,873
352
World Ranking
164
National Ranking
1

1996 - Fellow of American Physical Society (APS) Citation For the elucidation of the thermal and electronic properties of disordered materials and actinide compounds, and for his work on the biophysics of the neural control of the locomotion of nematodes

1983 - Wolf Prize in Mathematics for his numerous contributions to number theory, combinatorics, probability, set theory and mathematical analysis, and for personally stimulating mathematicians the world over.

1982 - Charles Coolidge Parlin Marketing Research Award, American Marketing Association

1980 - Fellow of the American Association for the Advancement of Science (AAAS)

1980 - Member of the National Academy of Sciences

1951 - Frank Nelson Cole Prize in Number Theory

1946 - Fellow of John Simon Guggenheim Memorial Foundation

1945 - Fellow of John Simon Guggenheim Memorial Foundation

- Combinatorics
- Discrete mathematics
- Real number

Paul Erdös mainly focuses on Combinatorics, Discrete mathematics, Pure mathematics, Algebra and Complement graph. His Graph, Integer, Ramsey's theorem, Graph power and Quartic graph study are his primary interests in Combinatorics. His Quartic graph research includes themes of Graph labeling and Factor-critical graph.

His Discrete mathematics study is mostly concerned with Strength of a graph, Voltage graph, Extremal graph theory, Butterfly graph and Hypergraph. His Extremal graph theory research integrates issues from Friendship graph and Erdős–Stone theorem. His Complement graph research is multidisciplinary, incorporating elements of Cubic graph and Null graph.

- On the evolution of random graphs (4376 citations)
- A combinatorial problem in geometry (1253 citations)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS (1001 citations)

Paul Erdös focuses on Combinatorics, Discrete mathematics, Pure mathematics, Algebra and Graph. His work is connected to Integer, Prime factor, Ramsey's theorem, Partition and Complement graph, as a part of Combinatorics. Discrete mathematics connects with themes related to Graph theory in his study.

- Combinatorics (57.93%)
- Discrete mathematics (41.62%)
- Pure mathematics (7.78%)

- Combinatorics (57.93%)
- Discrete mathematics (41.62%)
- Graph (6.14%)

His primary areas of investigation include Combinatorics, Discrete mathematics, Graph, Graph theory and Upper and lower bounds. His study in Combinatorics concentrates on Integer, Ramsey's theorem, Graph, Prime and Line graph. His Line graph and Voltage graph and Cubic graph investigations all form part of his Line graph research activities.

Discrete mathematics is closely attributed to Partition in his research. Graph is often connected to Chromatic scale in his work. His research on Upper and lower bounds frequently connects to adjacent areas such as Complete graph.

- On the evolution of random graphs (4376 citations)
- A combinatorial problem in geometry (1253 citations)
- Graphs of Extremal Weights. (385 citations)

- Combinatorics
- Real number
- Mathematical analysis

His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Graph and Bipartite graph. As part of his studies on Combinatorics, Paul Erdös frequently links adjacent subjects like Upper and lower bounds. His Discrete mathematics research incorporates themes from Combinatorial principles, Barycentric-sum problem and Combinatorial explosion.

Paul Erdös interconnects Mathematics education, Connected Mathematics, Core-Plus Mathematics Project and Partition in the investigation of issues within Graph. His work carried out in the field of Bipartite graph brings together such families of science as Triangle-free graph and Complete graph. His Integer research is multidisciplinary, relying on both Finite variation, Pure mathematics, Zero, Real number and Sequence.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

A combinatorial problem in geometry

P. Erdös;G. Szekeres.

Compositio Mathematica **(2009)**

1689 Citations

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

P. Erdós;Chao Ko;R. Rado.

Quarterly Journal of Mathematics **(1961)**

1345 Citations

On an extremal problem in graph theory

P. Erdös.

Colloquium Mathematicum **(1964)**

901 Citations

Graph Theory and Probability

P. Erdös.

Canadian Journal of Mathematics **(1959)**

860 Citations

Some remarks on the theory of graphs

P. Erdös.

Bulletin of the American Mathematical Society **(1947)**

758 Citations

Intersection Theorems for Systems of Sets

P. Erdös;R. Rado.

Journal of The London Mathematical Society-second Series **(1960)**

755 Citations

A note on Hamiltonian circuits

V. Chvátal;P. Erdös.

Discrete Mathematics **(1972)**

749 Citations

A Problem in Graph Theory

P. Erdos;A. Hajnal;J. W. Moon.

American Mathematical Monthly **(1964)**

732 Citations

On the structure of linear graphs

P. Erdös;A. H. Stone.

Bulletin of the American Mathematical Society **(1946)**

730 Citations

On a Problem in Graph Theory

P. Erdos.

The Mathematical Gazette **(1963)**

642 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Alfréd Rényi Institute of Mathematics

New York University

University of California, San Diego

University of Memphis

Alfréd Rényi Institute of Mathematics

Dartmouth College

University of California, San Diego

Hungarian Academy of Sciences

Eindhoven University of Technology

Rockefeller University

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.