Jacob Fox works on extremal combinatorics, Ramsey theory and algebraic and probabilistic methods in graph theory. His Stanford research page also identifies applications to computer science.[ref]
With David Conlon, Choongbum Lee and Benny Sudakov, he studied ordered Ramsey numbers. Requiring the vertices of a monochromatic copy to appear in a prescribed order can force superpolynomial growth even when the underlying graph is a matching.[ref]
Ordered Ramsey numbers by David Conlon and others. Abstract and ordered-matching results
Articles by others on the same topic
Jacob Fox is a name that may refer to several individuals in different contexts, but it is commonly associated with a mathematician known for his contributions to combinatorics, particularly in the area of random structures and probabilistic methods.