Peter Keevash

Peter Keevash
Born	(1978-11-30) 30 November 1978 (age 38) Brighton, England
Residence	Oxford, England
Nationality	British
Fields	Mathematics
Institutions	California Institute of Technology Queen Mary, University of London University of Oxford
Alma mater	Trinity College, Cambridge
Doctoral advisor	Benny Sudakov
Known for	Contributions to combinatorial design theory
Notable awards	European Prize in Combinatorics (2009) Whitehead Prize (2015)

Peter Keevash (born 30 November 1978) is a British mathematician, specializing in combinatorics. He is Professor of Mathematics at the University of Oxford and a Fellow of Mansfield College.

Keevash was born in Brighton, England, but mostly grew up in Leeds. He competed in the International Mathematical Olympiad in 1995. He entered Trinity College, University of Cambridge, in 1995 and completed his B.A. in mathematics in 1998. He earned his doctorate from Princeton University with Benny Sudakov as advisor. He took a postdoctoral position at the California Institute of Technology before moving to Queen Mary, University of London as a lecturer, and subsequently professor, before his move to Oxford in September 2013.

Keevash has published many results in combinatorics, particularly in extremal graph and hypergraph theory and Ramsey Theory. In joint work with Tom Bohman he established the best-known lower bound for the off-diagonal Ramsey Number ${\displaystyle R(3,k)}$, namely ${\displaystyle R(3,k)\geq \left({\frac {1}{4}}-o(1)\right)k^{2}/\log k.}$ (This result was obtained independently at the same time by Fiz Pontiveros, Griffiths and Morris.)

...
Wikipedia