معرفی
Tom Bohman is a Professor of Mathematical Sciences at Carnegie Mellon University, affiliated with the Mellon College of Science. His research focuses on extremal and probabilistic combinatorics, exploring discrete structures inspired by mathematics, information theory, statistical physics, and computer science. He holds a Ph.D. from Rutgers University and has held postdoctoral positions at MIT and the Mathematical Sciences Research Institute (MSRI).
Bohman's work includes studies on random graph processes, such as the triangle-free process and Hamilton cycles in random graphs, as well as hypergraph coloring and Ramsey numbers. His publications span over three decades, addressing topics like coprime matchings, lonely runner conjectures, and dynamic concentration phenomena in combinatorial systems.
He teaches advanced courses in combinatorics and discrete mathematics, including Graph Theory and Random Structures & Algorithms. His research has contributed to understanding phase transitions in random processes and the interplay between combinatorial structures and probabilistic methods.
While no awards are explicitly listed, his extensive publication record and editorial roles (e.g., with Random Structures & Algorithms) highlight his academic impact. Bohman's work often bridges theoretical foundations with algorithmic applications, influencing both pure and applied combinatorics.
