Tom Bohman

Tom Bohman is a Professor in the Department of Mathematical Sciences at Carnegie Mellon University. His research focuses on extremal and probabilistic combinatorics, with an emphasis on discrete mathematical problems influenced by information theory, statistical physics, and theoretical computer science. His work includes topics such as Shannon capacities of odd cycles, random graph models, and hypergraph discrepancy. Bohman's research has been published in leading mathematical journals, including the Proceedings of the American Mathematical Society and the IEEE Transactions on Information Theory. His academic profile can be accessed at https://www.cmu.edu/math/people/faculty/bohman.html.

Tom Bohman is a mathematician at Carnegie Mellon University, known for his research in extremal and probabilistic combinatorics. His work explores the evolution of random graph processes, focusing on the emergence of subgraphs such as triangles and Hamilton cycles. He investigates how random edges affect graph properties, including connectivity, Hamiltonicity, and the avoidance of giant components. Bohman also studies combinatorial structures like Steiner triple systems and hypergraph problems, often using probabilistic methods. His research includes topics such as the triangle-free process, random graph saturation, and the dynamics of graph evolution. His contributions span both theoretical and applied aspects of combinatorics, with a focus on understanding the interplay between randomness and structure in discrete mathematics.