Paul Seymour (mathematician)
From Wikipedia, the free encyclopedia
(photo from MFO)
Paul D. Seymour (born July 26, 1950) is a mathematician working in discrete mathematics, including combinatorics, graph theory, and optimization, at Princeton University, Princeton, New Jersey, United States.
Seymour was born in Plymouth, Devon, England. He was a day student at Plymouth College, and finished first nationwide in the University of Oxford entrance exam. He studied at Exeter College, Oxford, and received several degrees: BA in 1971, MSc in 1972, MA in 1975, and D.Phil in 1975.
He was responsible for pioneering breakthroughs on regular matroids and totally unimodular matrices, the four colour theorem, graph minors and structure, the strong perfect graph theorem, the Hadwiger conjecture, and claw-free graphs. He won the Fulkerson Prize in 1979, 1994, and 2006, the Pólya Prize in 1983 and 2004, and the Ostrowski Prize in 2004, among others.
He became full professor at Ohio State University, Columbus, Ohio, in 1983. From 1983 until 1996, he was at Bell Labs, then Bellcore (Bell Communications Research) Morristown, New Jersey (now Telcordia Technologies). He became professor at Princeton University in 1996. He is Editor-in-Chief for the Journal of Graph Theory. He married Shelley MacDonald of Ottawa in 1979, and they have two children, Amy and Emily.
[edit] See also
[edit] External links
- Paul Seymour, home page at Princeton
 |
This article about a mathematician is a stub. You can help Wikipedia by expanding it. |
