Neil Robertson (mathematician)
From Wikipedia, the free encyclopedia
 Photograph of Dr. Neil Robertson from The Ohio State University |
|
| Born | December, 1938 Canada |
|---|---|
| Residence | United States, Canada |
| Nationality | American |
| Field | Mathematician |
| Institution | The Ohio State University |
| Alma mater | University of Waterloo, 1969 |
| Academic advisor | William Tutte |
| Notable students | Kamal Chakravarti Bogdan Oporowski |
| Known for | Robertson-Seymour theorem |
| Notable prizes | Pólya Prize (SIAM) (2004, 2006) |
G. Neil Robertson is a mathematician working mainly in topological graph theory, currently a distinguished professor[1] at The Ohio State University. He earned his Ph.D. in 1969 at the University of Waterloo under his doctoral advisor William Tutte. Dr. Robertson has an Erdős number of 2 due to coauthoring a paper with Arthur M. Hobbs.[2]
Contents |
[edit] Biography
In 1969, Robertson joined the faculty of The Ohio State University, where he was promoted to Associate Professor in 1972 and Professor in 1984. He was a consultant with Bell Communications Research from 1984 to 1996. He has held visiting faculty positions in many institutions, most extensively at Princeton University from 1996 to 2001, and most recently at Victoria University of Wellington, New Zealand, in 2002.
[edit] Conferences
[edit] Invited or contributed presentations
- One week lecture series at the University of New Hampshire, Durham, New Hampshire: On the proof of the 4-color theorem, 2 hour lectures, and On the proof of the graph minor theorem, 2 hour lectures, November, 1994.
- AMS meeting at the University of Central Florida, Orlando, Florida: Binary matroids of branch-width three, 20 minutes, March 1995.
- The R. C. Bose Memorial conference, Fort Collins, Colorado: The four-color theorem, 36 minutes, June 1995.
- The third Slovene international conference in graph theory, Bled, Slovenia: Results and problems about representativity of graph embeddings, 50 minutes, June 1995.
- The AMS, IMS, Siam Joint Summer Research Conference, University of Washington, Seattle, Washington: Binary matroids of branch-width three, 45 minutes, July 1995.
- AMS meeting in Guanajuato, Mexico: Planar graphs on nonplanar surfaces", 20 minutes, November 1995.
- Some thoughts on Hadwiger's Conjecture. June 28, 1999.
[edit] Video
- Short conference video. Neil Robertson - Some thoughts on Hadwiger's Conjecture. June 28, 1999. Video produced by Bojan Mohar.
[edit] Theorem proofs
- Four color theorem [Full text]
- Robertson-Seymour theorem (Wagner's Conjecture)
- Hadwiger conjecture (graph theory)
- Strong Perfect Graph Theorem
[edit] Prizes
- Fulkerson Prize (1994, 2006) [3]
- Pólya Prize (SIAM) (2004)
- Distinguished Scholar Award (OSU) (1997)
- Alumni Achievement Medal (Waterloo) (2002)
[edit] References
- ^ [1] Neil Robertson awarded the title of Distinguished Professor
- ^ Collaboration Distance report from MathSciNet, Retrieved September 21, 2006.
- ^ [2] Fulkerson Prize Winners
