Neil Robertson (mathematician)

Neil Robertson ( born November 30, 1938 in Canada ) is an American mathematician, with combinatorics ( particularly graph theory) employed.

Robertson received his doctorate in 1969 with William Tutte at the University of Waterloo with a thesis on Graphs minimal under Girth, Valency, and Connectivity Constraints. He is a professor at Ohio State University.

Robertson proved with Paul Seymour, Robin Thomas and Maria Chudnovsky 2005, open since 1960, a strong presumption for Perfect graphs of Claude mountains. With Seymour, Thomas and Daniel P. Sanders, he is also involved in a program to simplify the four color theorem, which culminated in an alternative proof ( to that of Kenneth Appel and Wolfgang hook ). With Seymour he proved also in a long series of essays called set of Robertson - Seymour. Both received for the 1994 Fulkerson Prize. With Thomas and Seymour gave at full criteria for determining when a graph without links (ie, the linking number of two cycles of the embedded graph is zero, it then has a " shallow embedding " ) can be embedded in three-dimensional space ( ie, that he has no minors that are isomorphic to one of seven graphs of the Petersen family).

He is a Fellow of the American Mathematical Society.