What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Algebra
His main research concerns Combinatorics, Discrete mathematics, Random graph, Random regular graph and Chordal graph.
His is doing research in Indifference graph, Degree, Giant component, Enumeration and Regular graph, both of which are found in Combinatorics.
His research integrates issues of Asymptotic formula and Random element in his study of Discrete mathematics.
His studies in Random graph integrate themes in fields like Hopcroft–Karp algorithm, Random geometric graph and Strength of a graph.
Triangle-free graph is closely connected to Split graph in his research, which is encompassed under the umbrella topic of Random regular graph.
As a part of the same scientific family, Nicholas C. Wormald mostly works in the field of Chordal graph, focusing on Strongly regular graph and, on occasion, Bipartite graph.
His most cited work include:
- Sudden Emergence of a Giantk-Core in a Random Graph (375 citations)
- Differential Equations for Random Processes and Random Graphs (354 citations)
- Edge crossings in drawings of bipartite graphs (245 citations)
What are the main themes of his work throughout his whole career to date?
Nicholas C. Wormald mainly investigates Combinatorics, Discrete mathematics, Random graph, Random regular graph and Graph.
Indifference graph, Almost surely, Chordal graph, Degree and Vertex are among the areas of Combinatorics where the researcher is concentrating his efforts.
The study incorporates disciplines such as Pathwidth and Split graph in addition to Indifference graph.
His work in the fields of Discrete mathematics, such as Cubic graph, Line graph, Regular graph and Maximal independent set, overlaps with other areas such as Upper and lower bounds.
His Random graph study combines topics in areas such as Binary logarithm, Independent set, Greedy algorithm and Random geometric graph.
His Random regular graph research is multidisciplinary, incorporating perspectives in Strongly regular graph, Odd graph and Random element.
He most often published in these fields:
- Combinatorics (89.40%)
- Discrete mathematics (58.94%)
- Random graph (34.77%)
What were the highlights of his more recent work (between 2012-2021)?
- Combinatorics (89.40%)
- Random graph (34.77%)
- Discrete mathematics (58.94%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Random graph, Discrete mathematics, Graph and Vertex.
Nicholas C. Wormald regularly links together related areas like Logarithm in his Combinatorics studies.
His Random graph research focuses on Binary logarithm and how it relates to Connected component.
His primary area of study in Discrete mathematics is in the field of Random regular graph.
His Random regular graph research is multidisciplinary, incorporating elements of Indifference graph and Expander graph.
His Vertex research incorporates themes from Distributed algorithm and Orientability.
Between 2012 and 2021, his most popular works were:
- The mixing time of the giant component of a random graph (29 citations)
- Enumeration of graphs with a heavy-tailed degree sequence (20 citations)
- Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph (20 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Algebra
His main research concerns Combinatorics, Discrete mathematics, Random graph, Random regular graph and Graph.
Almost surely, Vertex, Conjecture, Path and Degree are the subjects of his Combinatorics studies.
Nicholas C. Wormald integrates Discrete mathematics with Running time in his study.
His Random graph research integrates issues from Algorithm, Chordal graph and Girth.
His Random regular graph research includes elements of Indifference graph, Maximal independent set, Expander graph and Vertex.
His Indifference graph study combines topics from a wide range of disciplines, such as Odd graph, Pathwidth, Split graph, Frequency partition of a graph and Asymptotic formula.
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.
