2023 - Research.com Mathematics in Hungary Leader Award
2022 - Research.com Engineering and Technology in Hungary Leader Award
2022 - Research.com Mathematics in Hungary Leader Award
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
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.
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.
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.
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.
On the evolution of random graphs
P. Erdos;A. Rényi.
A combinatorial problem in geometry
P. Erdös;G. Szekeres.
Compositio Mathematica (2009)
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
P. Erdós;Chao Ko;R. Rado.
Quarterly Journal of Mathematics (1961)
On an extremal problem in graph theory
Colloquium Mathematicum (1964)
Graph Theory and Probability
Canadian Journal of Mathematics (1959)
On the structure of linear graphs
P. Erdös;A. H. Stone.
Bulletin of the American Mathematical Society (1946)
Some remarks on the theory of graphs
Bulletin of the American Mathematical Society (1947)
Intersection Theorems for Systems of Sets
P. Erdös;R. Rado.
Journal of The London Mathematical Society-second Series (1960)
A note on Hamiltonian circuits
V. Chvátal;P. Erdös.
Discrete Mathematics (1972)
Graphs of Extremal Weights.
Béla Bollobás;Paul Erdös.
Ars Combinatoria (1998)
If you think any of the details on this page are incorrect, let us know.
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: