What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Graph theory
His primary areas of study are Combinatorics, Discrete mathematics, Planar graph, Graph minor and Forbidden graph characterization.
His study in Complement graph, Graph, Outerplanar graph, Branch-decomposition and Factor-critical graph falls within the category of Combinatorics.
Discrete mathematics is a component of his Matroid partitioning, Graphic matroid, Matroid, Robertson–Seymour theorem and Line graph studies.
His Planar graph research incorporates themes from Complete graph, Flow network, Computational complexity theory, Minimum weight and Planar straight-line graph.
The Graph minor study combines topics in areas such as Graph coloring, Wagner graph and Book embedding.
As part of the same scientific family, he usually focuses on Forbidden graph characterization, concentrating on Universal graph and intersecting with Partial k-tree.
His most cited work include:
- Graph minors. II: Algorithmic aspects of tree-width (1257 citations)
- Graph minors. XIII: the disjoint paths problem (1054 citations)
- The Strong Perfect Graph Theorem (1011 citations)
What are the main themes of his work throughout his whole career to date?
Paul Seymour mainly investigates Combinatorics, Discrete mathematics, Graph, Conjecture and Induced subgraph.
The Combinatorics study which covers Bounded function that intersects with Digraph.
His research in Graph minor, Matroid, Complement graph, Pathwidth and 1-planar graph are components of Discrete mathematics.
His research in the fields of Vertex and Vertex overlaps with other disciplines such as Subdivision.
He interconnects Partition, Complement, Bipartite graph and Existential quantification in the investigation of issues within Conjecture.
The various areas that Paul Seymour examines in his Planar graph study include Planar straight-line graph and Outerplanar graph.
He most often published in these fields:
- Combinatorics (98.30%)
- Discrete mathematics (60.23%)
- Graph (31.25%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (98.30%)
- Graph (31.25%)
- Induced subgraph (15.06%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Graph, Induced subgraph, Conjecture and Chromatic scale.
His work deals with themes such as Discrete mathematics and Bounded function, which intersect with Combinatorics.
In the field of Graph, his study on Vertex, Petersen graph and Exponential time hypothesis overlaps with subjects such as Subdivision.
His studies in Induced subgraph integrate themes in fields like Pathwidth, Homomorphism, Open problem, Polynomial and Clique.
His Conjecture research incorporates elements of Degree, Graph, Complement and Bipartite graph.
His study in the field of Clique number also crosses realms of Monochromatic color.
Between 2016 and 2021, his most popular works were:
- A survey of χ‐boundedness (21 citations)
- Induced subgraphs of graphs with large chromatic number. III. Long holes (21 citations)
- Large rainbow matchings in general graphs (20 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Graph theory
- Algebra
The scientist’s investigation covers issues in Combinatorics, Graph, Conjecture, Chromatic scale and Induced subgraph.
His biological study spans a wide range of topics, including Discrete mathematics and Bounded function.
His work on Windmill graph, Friendship graph and Coxeter graph as part of general Discrete mathematics research is often related to Monochromatic color, thus linking different fields of science.
His study looks at the relationship between Graph and fields such as Modulo, as well as how they intersect with chemical problems.
His research integrates issues of Path, Function, Generalization, Clique and Bipartite graph in his study of Conjecture.
His Induced subgraph study integrates concerns from other disciplines, such as Pathwidth, Homomorphism, Exponential time hypothesis, Free graph and Multigraph.
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.
