Jacob Fox


Hello! I am a Professor in the Department of Mathematics at Stanford Unversity. Before joining Stanford in 2015, I was part of the MIT Department of Mathematics. I completed my Ph.D. in mathematics at Princeton University in 2010. My advisor was Benny Sudakov.

My work is supported by a Packard Fellowship, an NSF CAREER award, and an Alfred P. Sloan Research Fellowship. I was previously supported by a Simons Fellowship.

Research Interests:
Extremal combinatorics, algebraic and probabilistic methods in combinatorics, Ramsey theory, graph theory, combinatorial geometry, and applications of combinatorics to computer science.

CV (last updated February 2015)

Publications

PhD Students:
László Miklós Lovász
Fan Wei
Lisa Sauermann
Yufei Zhao (graduated)
Andrey Grinshpun (graduated)

Co-Authors:
Eyal Ackerman, Mike Albertson, Boris Alexeev, Noga Alon, Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, David Conlon, Dan Cranston, Matt DeVos, Zednek Dvorak, Fabrizio Frati, William Gasarch, Ron Graham, Andrey Grinshpun, Mikhail Gromov, David G. Harris, Veselin Jungic, Peter Keevash, Daniel J. Kleitman, Vincent Lafforgue, Choongbum Lee, Kathy Lin, Anita Liebenau, Martin Loebl, Po-Shen Loh, László Miklós Lovász, Mohammad Mahdian, Jessica McDonald, Bojan Mohar, Assaf Naor, Jaroslav Nesetril, János Pach, Yury Person, Rom Pinchasi, Rados Radoicic, Diego Scheide, Alex Scott, Paul Seymour, Benny Sudakov, Andrew Suk, Tibor Szabo, Stephan Thomasse, Csaba D. Tóth, Douglas Ulrich, Samuel Zbarsky and Yufei Zhao.

Teaching:
Math 61DM: Modern Mathematics: Discrete Methods (Fall 2017)
Math 61DM: Modern Mathematics: Discrete Methods (Fall 2016)
Math 101: Math Discovery Lab (Fall 2016)
18.318 - Probabilistic Methods in Combinatorics (Spring 2014)
18.304 - Undergraduate Seminar in Discrete Mathematics (Spring 2014)
18.316 - Seminar in Combinatorics (Fall 2013)
18.318 - Topics in Combinatorics: Geometric Graph Theory (Spring 2013)
18.315 - Combinatorial Theory - Extremal Combinatorics (Fall 2011)
18.997 - Probabilistic Methods in Combinatorics (Spring 2011)
MAT 307 - Combinatorics (Spring 2009)

Slides:
Induced Ramsey-type theorems
Density theorems for bipartite graphs and related Ramsey-type results

Hannah and David

E-mail: jacobfox [@] stanford [dot] edu
Office: 384-X

Last updated (partially) 07/07/16.