Neil Robertson (mathematician)

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

Robertson received his doctorate in 1969 under 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 , Maria Chudnovsky and Robin Thomas 2005, since 1960 open strong presumption of perfect graphs of Claude Berge . With Seymour, Thomas and Daniel P. Sanders he is also involved in a program to simplify the four-color theorem, which resulted in an alternative proof (to that of Kenneth Appel and Wolfgang Haken ). With Seymour he also proved the so-called Robertson-Seymour theorem in a long series of essays . Both received the Fulkerson Prize for this in 1994 . With Thomas and Seymour he gave complete criteria for when a graph without links (that is, the number of links of two cycles of the embedded graph is zero, it then has a “flat embedding”) can be embedded in three-dimensional space (namely that it has no minors that are isomorphic to any of 7 graphs from the Petersen family).

He is a fellow of the American Mathematical Society .

Web links

personal data
SURNAME	Robertson, Neil
BRIEF DESCRIPTION	American mathematician
DATE OF BIRTH	November 30, 1938
PLACE OF BIRTH	Canada