Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Paul Seymour

Modern

Paul D. Seymour, born in 1950 in Plymouth, England, is a British mathematician known for his work in discrete mathematics, especially graph theory. He was responsible, with others, for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs and the Erdős-Hajnal conjecture. He studied at Exeter College, Oxford, gaining his D.Phil. in 1975 under Aubrey William Ingleton, and is now the Albert Baldwin Dod Professor of Mathematics at Princeton University. He won the Fulkerson Prize in 1979, 1994, 2006 and 2009, the Ostrowski Prize in 2003, and became a Fellow of the Royal Society in 2022.

Facts
Biography
Gender
Male 1
Connections

Attributed Works

Source Treewidth (Wikipedia)

In Branch

Source Wikipedia: Paul Seymour

Proofs Credited

Source Graph structure theorem (Wikipedia)
Source Robertson-Seymour Theorem (Wikipedia)
Source Strong perfect graph theorem (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikipedia: Paul Seymour
  • Lead paragraph
    He (with others) was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős-Hajnal conjecture.
  • In Branch: Graph Theory, Lead
    known for his work in discrete mathematics, especially graph theory
View the Source
Treewidth (Wikipedia)
Attributed Works: Treewidth, Lead sentence, attribution
Quote, Attributed Works: Treewidth, Lead sentence, attribution
rediscovered by Neil Robertson and Paul Seymour (1984)
View the Source
Strong perfect graph theorem (Wikipedia)
Proofs Credited: Strong Perfect Graph Theorem, Lead
Quote, Proofs Credited: Strong Perfect Graph Theorem, Lead
A proof by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas was announced in 2002 and published by them in 2006.
View the Source
Graph structure theorem (Wikipedia)
Proofs Credited: Graph Structure Theorem, Lead
Quote, Proofs Credited: Graph Structure Theorem, Lead
The theorem is stated in the seventeenth of a series of 23 papers by Neil Robertson and Paul Seymour.
View the Source
Robertson-Seymour Theorem (Wikipedia)
Wikimedia FoundationProofs Credited: Robertson-Seymour Theorem, Lead section
Quote, Proofs Credited: Robertson-Seymour Theorem, Lead section
The Robertson-Seymour theorem is named after mathematicians Neil Robertson and Paul D.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.