معرفی
Paul Seymour is a distinguished mathematician and Albert Baldwin Dod Professor at Princeton University, holding positions in both the Department of Mathematics and the Program in Applied and Computational Math. He earned his doctorate from Oxford University and has held roles at institutions including the University of Waterloo, Ohio State University, and Bellcore. His work focuses on discrete mathematics, graph theory, and optimization, with notable contributions to the four-color theorem, the strong perfect graph theorem, and Hadwiger's conjecture.
Education:
- PhD in Mathematics from Oxford University (1975), thesis on 'Matroids, hypergraphs and the max-flow min-cut theorem' under Aubrey William Ingleton.
Research Interests:
- Graph Theory: Structural properties, induced subgraphs, Erdős-Hajnal conjecture, chi-boundedness, and algorithmic approaches.
- Discrete Mathematics: Matroid theory, optimization, and combinatorial algorithms.
- Theoretical Contributions: Robertson–Seymour theorem, four-color theorem simplification, and strong perfect graph theorem.
Recent Research Trends: Recent articles explore induced subgraph density, polynomial chromatic bounds, and pure pairs in graph structures. His work often bridges theoretical insights with algorithmic applications, emphasizing structural graph theory.
Awards:
- Fulkerson Prize (1979, 1994, 2006, 2009)
- George Pólya Prize (1983, 2004)
- Ostrowski Prize (2003)
- Honorary doctorates from Waterloo (2008) and Technical University of Denmark (2013)
Collaborations & Roles: Editor-in-chief of the Journal of Graph Theory (with Carsten Thomassen). Active in collaborative efforts with Neil Robertson, Maria Chudnovsky, and others, producing foundational results like the Graph Minors series.
Labs & Teams: Leads research groups at Princeton focusing on structural graph theory and discrete mathematics. Collaborations include the annual Barbados Graph Theory Workshops.
