World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
44
Citations
10943
World Ranking
1555
National Ranking
671

Engineering and Technology

D-Index
44
Citations
10868
World Ranking
5703
National Ranking
1592

Research.com Recognitions

  • 2018 - SIAM Fellow For his contributions to structural graph theory and graph coloring, especially his work on the Four-Color Theorem and its generalizations and a proof the Strong Perfect Graph Theorem.
  • 2013 - Fellow of the American Mathematical Society

Overview

Robin Thomas is affiliated with the Georgia Institute of Technology in the United States. Their research primarily centers on computer science and mathematics, with particular focus on computational theory and mathematics as well as discrete mathematics and combinatorics.

Their work extensively explores advanced graph theory, with topics including:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Computational Geometry and Mesh Generation
  • Graph theory and CDMA systems
  • Advanced Topology and Set Theory
  • Vaccine Coverage and Hesitancy

Robin Thomas has authored publications in several venues, with frequent contributions to:

  • Journal of Combinatorial Theory Series B
  • arXiv (Cornell University)
  • European Journal of Public Health
  • International Journal of Eating Disorders
  • International Journal of Environmental Research and Public Health

Some recent publications include:

  • "The association of adverse life events with children's emotional overeating and restrained eating in a population-based cohort," 2020, International Journal of Eating Disorders
  • "Packing cycles in undirected group-labelled graphs," 2023, Journal of Combinatorial Theory Series B

Robin Thomas has collaborated frequently with several coauthors, such as:

  • Zdeněk Dvořák
  • Daniel Kráľ
  • Youngho Yoo
  • Lorena Charrier
  • Carla Maria Zotti

Their research contributions have been recognized with awards including:

  • SIAM Fellow, 2018, for contributions to structural graph theory and graph coloring, especially work on the Four-Color Theorem, its generalizations, and the Strong Perfect Graph Theorem
  • Fellow of the American Mathematical Society, 2013

Best Publications

  • The Strong Perfect Graph Theorem

    Maria Chudnovsky;Neil Robertson;Paul Douglas Seymour;Robin Thomas

  • The Four-Colour Theorem

    Neil Robertson;Daniel Sanders;Paul Seymour;Robin Thomas

  • Graph searching and a min-max theorem for tree-width

    P. D. Seymour;Robin Thomas

  • Quickly excluding a planar graph

    Neil Robertson;Paul Seymour;Robin Thomas;Robin Thomas

  • Call routing and the ratcatcher

    Paul Douglas Seymour;R. Thomas

  • Hadwiger's conjecture for K6-free graphs

    Neil Robertson;Paul Douglas Seymour;Robin Thomas

  • Directed Tree-Width

    Thor Johnson;Neil Robertson;P.D. Seymour;Robin Thomas

  • PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS

    Neil Robertson;Paul D. Seymour;Robin Thomas

  • Sachs' linkless embedding conjecture

    Neil Robertson;Paul Seymour;Robin Thomas

  • A separator theorem for graphs with an excluded minor and its applications

    N. Alon;P. Seymour;R. Thomas

  • A separator theorem for nonplanar graphs

    Noga Mordechai Alon;Paul Douglas Seymour;Robin Thomas

  • On the complexity of finding iso- and other morphisms for partial k -trees

    Jiří Matoušek;Robin Thomas

  • 4-Connected Projective-Planar Graphs Are Hamiltonian

    R. Thomas;X.X. Yu

  • Packing directed circuits

    Bruce Reed;Neil Robertson;Paul Douglas Seymour;Robin Thomas

  • A new proof of the four-colour theorem

    Neil Robertson;Daniel P. Sanders;Paul Seymour;Robin Thomas

  • Quickly excluding a forest

    Dan Bienstock;Neil Robertson;Paul Seymour;Robin Thomas

  • An improved linear edge bound for graph linkages

    Robin Thomas;Paul Wollan

  • Efficiently four-coloring planar graphs

    Neil Robertson;Daniel P. Sanders;Paul Seymour;Robin Thomas

  • AN UPDATE ON THE FOUR-COLOR THEOREM

    Robin Thomas

  • Topics in Discrete Mathematics

    Martin Klazar;Jan Kratochvíl;Martin Loebl;Jiří Matoušek

  • Permanents, Pfaffian orientations, and even directed circuits

    William McCuaig;Neil Robertson;Paul Douglas Seymour;Robin Thomas

Frequent Co-Authors

Paul Seymour
Paul Seymour Princeton University
Neil Robertson
Neil Robertson The Ohio State University
Daniel Král
Daniel Král Masaryk University
Ken-ichi Kawarabayashi
Ken-ichi Kawarabayashi National Institute of Informatics
Maria Chudnovsky
Maria Chudnovsky Princeton University
Noga Alon
Noga Alon Tel Aviv University
Jiří Matoušek
Jiří Matoušek Charles University
Vojtěch Rödl
Vojtěch Rödl Emory University
Jaroslav Nešetřil
Jaroslav Nešetřil Charles University
Magnus Egerstedt
Magnus Egerstedt University of North Carolina at Chapel Hill

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, expanding skills through related online degrees can open diverse career opportunities. Many students consider business-oriented programs like the easiest mba program to get into as a flexible path to combine analytical math skills with leadership and management expertise.

If affordability is a priority, exploring the cheap online masters in finance offers a focused education that leverages mathematical skills in financial analysis, risk assessment, and investment strategies. Such degrees often provide practical training valued by employers in finance and banking sectors.

For those aiming to advance further in academia or industry leadership, a 1 year dba program online can be a time-efficient option to deepen research and business administration skills. These programs are designed for working professionals seeking quick advancement without sacrificing career momentum.

Additionally, the easiest mba programs provide accessible routes to earn a respected graduate degree online. Such programs often prioritize flexibility, making them ideal for students balancing studies with work or other commitments.

Best Scientists Citing Robin Thomas

Trending Scientists

Recently Published Articles