What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- On the evolution of random graphs (4376 citations)
- A combinatorial problem in geometry (1253 citations)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS (1001 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (57.93%)
- Discrete mathematics (41.62%)
- Pure mathematics (7.78%)
What were the highlights of his more recent work (between 1986-2020)?
- Combinatorics (57.93%)
- Discrete mathematics (41.62%)
- Graph (6.14%)
In recent papers he was focusing on the following fields of 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.
Between 1986 and 2020, his most popular works were:
- On the evolution of random graphs (4376 citations)
- A combinatorial problem in geometry (1253 citations)
- Graphs of Extremal Weights. (385 citations)
In his most recent research, the most cited papers focused on:
- 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.
