Jacob Fox

Affiliations:	2010-2015		Massachusetts Institute of Technology, Cambridge, MA, United States
	2015-	Mathematics	Stanford University, Palo Alto, CA

Benjamin Sudakov	grad student	2010	Princeton
(Ramsey Numbers)

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.
Conlon D, Fox J, Sudakov B. (2020) Books versus Triangles at the Extremal Density Siam Journal On Discrete Mathematics. 34: 385-398
Fox J, Li R. (2020) On Ramsey numbers of hedgehogs Combinatorics, Probability & Computing. 29: 101-112
Fox J, Sah A, Sawhney M, et al. (2020) Triforce and corners Arxiv: Combinatorics. 169: 209-223
Ferber A, Fox J, Jain V. (2020) Towards the linear arboricity conjecture Journal of Combinatorial Theory, Series B. 142: 56-79
Fox J, Pach J, Suk A. (2020) The Schur-Erdős problem for semi-algebraic colorings Israel Journal of Mathematics. 1-19
Conlon D, Fox J, Sudakov B. (2020) Short proofs of some extremal results III Random Structures and Algorithms
Chudnovsky M, Fox J, Scott A, et al. (2020) Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs Journal of Graph Theory
Conlon D, Fox J, Sudakov B. (2019) Tower-type bounds for unavoidable patterns in words Transactions of the American Mathematical Society. 372: 6213-6229
Fox J, Lovász LM, Zhao Y. (2019) A fast new algorithm for weak graph regularity Combinatorics, Probability & Computing. 28: 777-790
Fox J, He X, Manners F. (2019) A proof of Tomescu's graph coloring conjecture Journal of Combinatorial Theory, Series B. 136: 204-221