Tom Kelly

Tom Kelly is an Assistant Professor at the School of Mathematics, Georgia Institute of Technology, specializing in Combinatorics and Graph Theory. His research intersects with Theoretical Computer Science, particularly in algorithms and randomness. He co-organizes the Atlanta Combinatorics Colloquium and the Georgia Tech Combinatorics Seminar. His current PhD students include Sarah Frederickson, Xuanang Li, and Tantan Dai, and he is funded by NSF Grant DMS-2247078.

Dr. Kelly's research focuses on graph decompositions, hypergraph coloring, and probabilistic combinatorics. He has made significant contributions to problems like the Erdős-Faber-Lovász conjecture and threshold phenomena in Latin squares. His work often employs advanced techniques such as absorption methods and nibble algorithms.

His recent publications explore entropy bounds, Steiner systems, and Hamilton transversals, reflecting his interest in extremal combinatorics and random structures. He teaches graduate and undergraduate courses in combinatorics and graph theory, including Math 3012 (Applied Combinatorics) and Math 7016 (Combinatorics). He also led research initiatives like the Georgia Tech Summer 2023 REU project on Latin squares.