Robin Thomas
Papers
2
Total Citations
25
H-Index
2
About
Robin Thomas is a mathematician whose primary research lies in graph theory, with a particular focus on graph coloring, decomposition, and the structural properties of graphs that avoid certain induced subgraphs. His most influential work addresses the problem of deploying robots with limited sensors—specifically, two sensors—on the vertices of a graph. In his highly cited 2015 paper, Thomas proved that any graph with minimum degree at least two and no induced \(K_{1,6}\) subgraph (a star with six leaves) can be assigned two-element subsets from a five-element set to its vertices, satisfying a specific local constraint, unless the graph belongs to one of eight exceptional cases. This result, building on an earlier 2013 version, has accumulated 23 citations, reflecting its significance in algorithmic graph theory and distributed robotics. Thomas’s contributions provide a deep structural understanding of how to coordinate simple agents on complex networks, with implications for sensor network deployment and multi-robot systems. His work is characterized by elegant combinatorial arguments and a keen eye for exceptional structures, making him a notable figure in modern graph theory.
Research Focus
Key Achievements
Top Papers
- 1Deploying Robots With Two Sensors in <i>K</i><sub>1, 6</sub>‐Free Graphs23 citations · 2015
- 2Deploying robots with two sensors in $K_{1,6}$-free graphs2 citations · 2013