Regular biography
David Conlon is a Professor of Mathematics at the California Institute of Technology, affiliated with the Division of Physics, Mathematics and Astronomy. His research areas are in mathematics, and he holds a Ph.D. from the University of Cambridge. Conlon received his B.A. from the University of Dublin Trinity College and M.A. from the University of Cambridge. He has been a Moore Distinguished Scholar at Caltech since 2018 and has held the title of Professor since 2019. His contact information includes an email address and office details at Caltech.
Scholar-generated biography
David Conlon is a researcher at the California Institute of Technology, specializing in Extremal and Probabilistic Combinatorics. His work focuses on understanding the structure and properties of large combinatorial objects, particularly in the context of random graphs and hypergraphs. Conlon's research includes significant contributions to Ramsey theory, extremal graph theory, and the study of sparse pseudorandom graphs. His publications explore topics such as Ramsey numbers, graph removal lemmas, and the KŁR conjecture in random graphs. His research has advanced the understanding of combinatorial theorems in sparse settings and has implications for various areas of discrete mathematics.