What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Graph theory
Benny Sudakov mainly investigates Combinatorics, Discrete mathematics, Graph, Random regular graph and Random graph.
His Combinatorics study frequently draws connections to adjacent fields such as Pseudorandom number generator.
His research related to Graph power, Conjecture, Split graph, Bipartite graph and Bound graph might be considered part of Discrete mathematics.
His work deals with themes such as Binary logarithm and Constant factor, which intersect with Graph.
His study explores the link between Random regular graph and topics such as Triangle-free graph that cross with problems in Strongly regular graph and Maximal independent set.
His work deals with themes such as Extremal graph theory, Line graph and Regular graph, which intersect with Random graph.
His most cited work include:
- Finding a large hidden clique in a random graph (217 citations)
- Pseudo-random Graphs (160 citations)
- The Largest Eigenvalue of Sparse Random Graphs (135 citations)
What are the main themes of his work throughout his whole career to date?
Benny Sudakov mainly focuses on Combinatorics, Discrete mathematics, Graph, Conjecture and Random graph.
His study in Complete graph, Ramsey's theorem, Hypergraph, Bipartite graph and Vertex is carried out as part of his Combinatorics studies.
His Discrete mathematics study is mostly concerned with Random regular graph, Graph power, Complement graph, Bound graph and Factor-critical graph.
His study in the field of Vertex is also linked to topics like Omega.
The study incorporates disciplines such as Disjoint sets, Independence number, Edge and Tournament in addition to Conjecture.
His Random graph study incorporates themes from Almost surely, Graph property, Hamiltonian path and Degree.
He most often published in these fields:
- Combinatorics (100.00%)
- Discrete mathematics (47.86%)
- Graph (33.33%)
What were the highlights of his more recent work (between 2018-2021)?
- Combinatorics (100.00%)
- Conjecture (27.75%)
- Graph (33.33%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Combinatorics, Conjecture, Graph, Bipartite graph and Random graph.
His Conjecture research incorporates themes from Disjoint sets, Lemma and Complete graph.
His Graph study combines topics from a wide range of disciplines, such as Sublinear function and Partition.
His study looks at the intersection of Bipartite graph and topics like Turán number with Rank.
Random graph is a subfield of Discrete mathematics that Benny Sudakov explores.
His research on Discrete mathematics often connects related areas such as Graph.
Between 2018 and 2021, his most popular works were:
- Decompositions into spanning rainbow structures (24 citations)
- A counterexample to Stein's Equi-n-square Conjecture (12 citations)
- An algebraic perspective on integer sparse recovery (12 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Discrete mathematics
- Graph theory
Benny Sudakov focuses on Combinatorics, Conjecture, Graph, Bipartite graph and Ramsey's theorem.
Many of his studies on Combinatorics involve topics that are commonly interrelated, such as Discrete mathematics.
Benny Sudakov focuses mostly in the field of Conjecture, narrowing it down to topics relating to Disjoint sets and, in certain cases, Matroid and Vector space.
When carried out as part of a general Graph research project, his work on Dense graph is frequently linked to work in Has property, therefore connecting diverse disciplines of study.
His study in Bipartite graph is interdisciplinary in nature, drawing from both Log-log plot and Independence number.
His Ramsey's theorem research integrates issues from Ramsey theory, Tree, Directed graph and Complete bipartite graph.
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.
