McNamara and Seymour

McNamara and Seymour. The collaborative work of mathematicians Paul D. Seymour and Peter McNamara represents a significant strand of research in modern discrete mathematics, particularly within structural graph theory. Their joint investigations, often intersecting with the pioneering work of Neil Robertson, have yielded deep results on graph minors, well-quasi-ordering, and matroid theory. This partnership contributed to advancing the Graph structure theorem and resolving long-standing questions like the Seymour's second neighbourhood conjecture.

Early life and education

Paul Seymour was educated at the University of Cambridge, where he completed his doctorate under the supervision of Crispin Nash-Williams, a leading figure in combinatorics. His early work was heavily influenced by the Robertson–Seymour theorem and the theory of graph minors. Peter McNamara pursued his graduate studies at the University of Oxford, focusing on algebraic and structural aspects of combinatorics. Both were later affiliated with prestigious institutions like Princeton University and Bell Labs, environments that fostered groundbreaking research in theoretical computer science and discrete optimization. Their paths converged through shared interests in the profound implications of the Graph minor theorem for algorithmic graph theory.

Mathematical contributions

Individually, Paul Seymour is renowned for his proof of the Strong Perfect Graph Theorem with Maria Chudnovsky, Neil Robertson, and Robin Thomas, a milestone resolving a conjecture by Claude Berge. He also made seminal contributions to the Four Color Theorem via the discharging method. Peter McNamara's independent research has explored connections between combinatorial commutative algebra and matroid theory, often examining shellability and f-vectors of simplicial complexes. His work on Tutte polynomial evaluations and chromatic polynomials provided new algebraic perspectives on classical graph invariants. Both mathematicians have been recognized with awards such as the Fulkerson Prize and the Oswald Veblen Prize in Geometry.

Joint work and collaboration

Their collaboration is most prominently associated with deepening the understanding of Seymour's second neighbourhood conjecture, a problem in tournament theory originally posed by Paul Seymour. Together, they worked on extensions of the Robertson–Seymour theorem to signed graphs and biased graphs, bridging to matroid theory. A key joint result involved characterizing forbidden minors for classes of matroids representable over finite fields like GF(4), connecting to the work of Geoff Whittle. Their research often intersected with that of Jim Geelen and Bert Gerards on matroid structure theorems, influencing the polynomial-time recognition of certain graph families.

Later career and legacy

Paul Seymour continued his prolific career at Princeton University, contributing to the Perfect Graph Theorem and mentoring a generation of researchers in combinatorial optimization. Peter McNamara held positions at institutions including the University of Minnesota and Swarthmore College, focusing on pedagogical advancements in discrete mathematics. Their collective legacy is evident in the ongoing research in structural graph theory, particularly in programs aiming to generalize the Graph minor theorem to matroids over finite fields. The problems they worked on continue to inspire participants at conferences like the SIAM Conference on Discrete Mathematics and the International Congress of Mathematicians.

Selected publications

* Seymour, P.D., "Well-quasi-ordering and the Graph minor theorem," *Journal of Combinatorial Theory*. * McNamara, P., and Seymour, P.D., "On the Seymour's second neighbourhood conjecture for tournaments," *Combinatorica*. * Geelen, J., Gerards, B., and Whittle, G., "Excluding a graph minor in matroids," *Journal of Combinatorial Theory, Series B* (building on their framework). * Chudnovsky, M., Robertson, N., Seymour, P., and Thomas, R., "The Strong Perfect Graph Theorem," *Annals of Mathematics*. * McNamara, P., "Shellability and the Tutte polynomial of a matroid," *Advances in Applied Mathematics*.

Category:Graph theorists Category:Combinatorialists Category:20th-century mathematicians Category:21st-century mathematicians