Robin Thomas (mathematician)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Waacstats (talk | contribs) at 20:55, 13 October 2012 (persondata). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Robin Thomas is a mathematician working in graph theory at the Georgia Institute of Technology.

Thomas received his doctorate in 1985 from Charles University in Prague, Czechoslovakia (now the Czech Republic), under the supervision of Jaroslav Nešetřil.[1] He joined the faculty at Georgia Tech in 1989, and is now a Regents' Professor there.[2][3]

Awards

Thomas was awarded the Fulkerson Prize for outstanding papers in discrete mathematics twice,[4] in 1994 as co-author of a paper on the Hadwiger conjecture,[5] and in 2009 for the proof of the strong perfect graph theorem.[6] In 2011 he was awarded the Karel Janeček Foundation Neuron Prize for Lifetime Achievement in Mathematics.[7]

References

  1. ^ Robin Thomas at the Mathematics Genealogy Project.
  2. ^ Author biography from Berg, Deborah E.; Norine, Serguei; Su, Francis Edward; Thomas, Robin; Wollan, Paul. "Voting in agreeable societies". arXiv:0811.3245..
  3. ^ Robin Thomas Earns Distinction, Named Regents' Professor, Georgia Tech College of Computing, June 24, 2010.
  4. ^ Fulkerson Prize: Official site with award details.
  5. ^ Robertson, Neil; Seymour, Paul; Thomas, Robin (1993), "Hadwiger's conjecture for K6-free graphs", Combinatorica, 13 (3): 279–361, doi:10.1007/BF01202354.
  6. ^ Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem", Annals of Mathematics, 164 (1): 51–229, doi:10.4007/annals.2006.164.51.
  7. ^ Karel Janeček Foundation 2011 Neuron Prize winners (in Czech)

External links

Template:Persondata