- Home
- Best Scientists - Mathematics
- Paul Seymour

Mathematics

USA

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
74
Citations
29,951
330
World Ranking
135
National Ranking
74

Engineering and Technology
D-index
74
Citations
29,846
321
World Ranking
350
National Ranking
150

2023 - Research.com Mathematics in United States Leader Award

2004 - George Pólya Prize

1983 - Fellow of Alfred P. Sloan Foundation

1983 - George Pólya Prize

- 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.

- 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)

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.

- Combinatorics (98.30%)
- Discrete mathematics (60.23%)
- Graph (31.25%)

- Combinatorics (98.30%)
- Graph (31.25%)
- Induced subgraph (15.06%)

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.

- 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)

- 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.

Graph minors. II: Algorithmic aspects of tree-width

Neil Robertson;Paul D. Seymour.

Journal of Algorithms **(1986)**

2071 Citations

Graph Minors

Neil Robertson;P.D. Seymour.

Journal of Combinatorial Theory, Series B **(1996)**

2055 Citations

Graph minors. XIII: the disjoint paths problem

Neil Robertson;P. D. Seymour.

Journal of Combinatorial Theory, Series B **(1995)**

1584 Citations

The Strong Perfect Graph Theorem

Maria Chudnovsky;Neil Robertson;Paul Douglas Seymour;Robin Thomas.

Annals of Mathematics **(2006)**

1419 Citations

Graph Minors. XX. Wagner's conjecture

Neil Robertson;P. D. Seymour.

Journal of Combinatorial Theory, Series B **(2004)**

1086 Citations

Decomposition of regular matroids

Paul D. Seymour;Paul D. Seymour.

Journal of Combinatorial Theory, Series B **(1980)**

1012 Citations

The Four-Colour Theorem

Neil Robertson;Daniel Sanders;Paul Seymour;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1997)**

959 Citations

Graph minors. V. Excluding a planar graph

Neil Robertson;P D Seymour.

Journal of Combinatorial Theory, Series B **(1986)**

940 Citations

Graph minors. III. Planar tree-width

Neil Robertson;Paul D. Seymour.

Journal of Combinatorial Theory, Series B **(1984)**

898 Citations

Graph minors: X. obstructions to tree-decomposition

Neil Robertson;P. D. Seymour.

Journal of Combinatorial Theory, Series B **(1991)**

853 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

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:

Princeton University

The Ohio State University

Georgia Institute of Technology

University of Amsterdam

McGill University

Tel Aviv University

Stanford University

Monash University

Dartmouth College

Technical University of Denmark

University of the Witwatersrand

Toyohashi University of Technology

University of the Basque Country

University of Zaragoza

Seoul National University

École nationale vétérinaire d'Alfort

Purdue University West Lafayette

University of Oxford

University of Amsterdam

University of Geneva

Scottish Universities Environmental Research Centre

University of Johannesburg

Forschungszentrum Jülich

National Oceanic and Atmospheric Administration

University of California, Irvine

University of New Mexico

Something went wrong. Please try again later.