Robin Thomas

School of Mathematics
Georgia Institute of Technology
Atlanta, Georgia 30332
thomas(at)math.gatech.edu
FAX: 404-894-4409

Mathematical Interests:

Graph theory (including infinite graphs), Combinatorics, Combinatorial Optimization, Algorithms

Current research:

The Four Color Theorem and its generalizations, Hamiltonian graphs on surfaces, embeddings of graphs, topological and structural graph theory, disjoint paths in graphs, matchings and Pfaffian orientations, efficient algorithms, perfect graphs. Research sponsored by the National Science Foundation.

Recent manuscripts:

  1. K_6 minors in 6-connected graphs of bounded tree-width (with K. Kawarabayashi, S. Norin and P. Wollan), arXiv:1203.2171
  2. K_6 minors in large 6-connected graphs (with K. Kawarabayashi, S. Norin and P. Wollan), arXiv:1203.2192
  3. Coloring planar graphs with triangles far apart (with Z. Dvorak and D. Kral), arXiv:0911.0885.
  4. Sub-exponentially many 3-colorings of triangle-free planar graphs (with A. Asadi, Z. Dvorak and L. Postle), J. Combin. Theory Ser. B (2013), http://dx.doi.org/10.1016/j.jctb.2013.09.001, arXiv:1007.1430.
  5. Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle (with Z. Dvorak and D. Kral), arXiv:1010.2472.
  6. Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk (with Z. Dvorak and D. Kral), arXiv:1302.2158.
  7. Testing first-order properties for subclasses of sparse graphs (with Z. Dvorak and D. Kral), to appear in J. Assoc. Comp. Machinery, arXiv:1109.5036. Here is a FOCS 2010 version.
  8. A New Proof of the Flat Wall Theorem (with K. Kawarabayashi and P. Wollan), arXiv:1207.6927.
  9. Deploying robots with two sensors in K_{1,6}-free graphs (with W. Abbas, M. Egerstedt, C.-H. Liu and P. Whalen), arXiv:1308.5450.
  10. Odd K_3,3 subdivisions in bipartite graphs (with P. Whalen), arXiv:1309.5336.
  11. Non-planar extensions of planar graphs (with S. Norin), arXiv:1402.1999.
  12. Non-embeddable extensions of embedded minors (with R. Hegde), arXiv:1401.2973.
  13. Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs (with L. Postle), arXiv:1402.1813.
  14. List-coloing apex-minor-free graphs (with Z. Dvorak), arXiv:1401.1399.
  15. Three-coloring triangle-free graphs on surfaces III. Graphs of girth five (with Z. Dvorak and D. Kral), arXiv:1402.4710.
  16. Excluded minors in cubic graphs (with N.Robertson and P.D.Seymour), arXiv:1403.2118.
  17. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs (with Z. Dvorak and D. Kral), arXiv:1404.6356.
  18. Girth six cubic graphs have Petersen minors (with N.Robertson and P.D.Seymour), arXiv:1405.0533.
  19. Excluding subdivisions of bounded degree graphs (with C.-H. Liu), arXiv:1407.4428.
All other papers

Professional Service:

Teaching:

Fall 2014:

Doctoral students:

Pointers: