Search results
Results from the WOW.Com Content Network
Robin Thomas (August 22, 1962 – March 26, 2020) was 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 . [ 3 ]
Mathematics fractal compression: Leonid Bunimovich: Mathematics dynamical systems; discovered focusing chaotic billiards (the "Bunimovich stadium") and the Bunimovich mushroom: Ernie Croot: Mathematics proved the Erdős–Graham conjecture: D. M. Smith: Mathematics Robin Thomas: Mathematics graph theory; proved the strong perfect graph and ...
A proof by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas was announced in 2002 [1] and published by them in 2006. The proof of the strong perfect graph theorem won for its authors a $10,000 prize offered by Gérard Cornuéjols of Carnegie Mellon University [2] and the 2009 Fulkerson Prize. [3]
The conjectured strong perfect graph theorem became the focus of research in the theory of perfect graphs for many years, [12] until its proof was announced in 2002 by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas, [14] and published by them in 2006. [4] This work won its authors the 2009 Fulkerson Prize. [15]
Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas, for the strong perfect graph theorem. [36] [37] Daniel A. Spielman and Shang-Hua Teng, for smoothed analysis of linear programming algorithms. [38] [37] Thomas C. Hales and Samuel P. Ferguson, for proving the Kepler conjecture on the densest possible sphere packings. [39] [40 ...
Maria Chudnovsky, Neil Robertson, Paul D. Seymour, and Robin Thomas: strong perfect graph conjecture: perfect graphs: Chudnovsky–Robertson–Seymour–Thomas theorem 2002: Grigori Perelman: Poincaré conjecture, 1904: 3-manifolds: 2003: Grigori Perelman: geometrization conjecture of Thurston: 3-manifolds: ⇒spherical space form conjecture: 2003
Discover the best free online games at AOL.com - Play board, card, casino, puzzle and many more online games while chatting with others in real-time.
Daniel P. Sanders is an American mathematician. He is known for his 1996 efficient proof of proving the Four color theorem (with Neil Robertson, Paul Seymour, and Robin Thomas).