Publications (70)
Extremal results in sparse pseudorandom graphs
David Conlon, Jacob Fox, Yufei Zhao
Ramsey-type results for semi-algebraic relations
David Conlon, Jacob Fox, János Pach +2
Crossings, colorings, and cliques
Michael O. Albertson, Daniel W. Cranston, Jacob Fox
A tight bound for Green's arithmetic triangle removal lemma in vector spaces
Jacob Fox, László Miklós Lovász
The ErdÅs-Gyárfás problem on generalized Ramsey numbers
David Conlon, Jacob Fox, Choongbum Lee +1
On the minimum degree of minimal Ramsey graphs for multiple colours
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
On the number of cliques in graphs with a forbidden minor
Jacob Fox, Fan Wei
Hypergraph Ramsey numbers
David Conlon, Jacob Fox, Benny Sudakov
On a problem of Duke-Erdos-Rodl on cycle-connected subgraphs
Jacob Fox, Benny Sudakov
Recent developments in graph Ramsey theory
David Conlon, Jacob Fox, Benny Sudakov
Ramsey numbers of cubes versus cliques
David Conlon, Jacob Fox, Choongbum Lee +1
The Removal Lemma for Tournaments
Jacob Fox, Lior Gishboliner, Asaf Shapira +1
Fast property testing and metrics for permutations
Jacob Fox, Fan Wei
Directed graphs without short cycles
Jacob Fox, Peter Keevash, Benny Sudakov
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing
Jacob Fox, Janos Pach, Andrew Suk
Approximating the rectilinear crossing number
Jacob Fox, Janos Pach, Andrew Suk
Large induced trees in K_r-free graphs
Jacob Fox, Po-Shen Loh, Benny Sudakov
Constructing dense graphs with sublinear Hadwiger number
Jacob Fox
Towards Erdos-Hajnal for graphs with no 5-hole
Maria Chudnovsky, Jacob Fox, Alex Scott +2
Graph removal lemmas
David Conlon, Jacob Fox
Large almost monochromatic subsets in hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
Ramsey-type problem for an almost monochromatic K_4
Jacob Fox, Benny Sudakov
ErdÅs-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
Jacob Fox, Lisa Sauermann
A semi-algebraic version of Zarankiewicz's problem
Jacob Fox, János Pach, Adam Sheffer +2
Hedgehogs are not colour blind
David Conlon, Jacob Fox, VojtÄch Rödl
Linear forms from the Gowers uniformity norm
David Conlon, Jacob Fox, Yufei Zhao
On minimal colorings without monochromatic solutions to a linear equation
Boris Alexeev, Jacob Fox, Ron Graham
Short proofs of some extremal results
David Conlon, Jacob Fox, Benny Sudakov
Applications of a new separator theorem for string graphs
Jacob Fox, Janos Pach
A tight lower bound for Szemerédi's regularity lemma
Jacob Fox, László Miklós Lovász
Maximum union-free subfamilies
Jacob Fox, Choongbum Lee, Benny Sudakov
The Green-Tao theorem: an exposition
David Conlon, Jacob Fox, Yufei Zhao
Bounds for graph regularity and removal lemmas
David Conlon, Jacob Fox
A new proof of the graph removal lemma
Jacob Fox
Overlap properties of geometric expanders
Jacob Fox, Mikhail Gromov, Vincent Lafforgue +2
What is Ramsey-equivalent to a clique?
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
Stanley-Wilf limits are typically exponential
Jacob Fox
The number of edges in k-quasi-planar graphs
Jacob Fox, Janos Pach, Andrew Suk
Ramsey numbers of sparse hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
On the grid Ramsey problem and related questions
David Conlon, Jacob Fox, Choongbum Lee +1
Chromatic number, clique subdivisions, and the conjectures of Hajós and ErdÅs-Fajtlowicz
Jacob Fox, Choongbum Lee, Benny Sudakov
Decompositions into subgraphs of small diameter
Jacob Fox, Benny Sudakov
Density theorems for bipartite graphs and related Ramsey-type results
Jacob Fox, Benny Sudakov
An improved bound for the stepping-up lemma
David Conlon, Jacob Fox, Benny Sudakov
Induced Ramsey-type theorems
Jacob Fox, Benny Sudakov
On a problem of ErdÅs and Rothschild on edges in triangles
Jacob Fox, Po-Shen Loh
An approximate version of Sidorenko's conjecture
David Conlon, Jacob Fox, Benny Sudakov
Paths and stability number in digraphs
Jacob Fox, Benny Sudakov
Lines in Euclidean Ramsey theory
David Conlon, Jacob Fox
Ordered Ramsey numbers
David Conlon, Jacob Fox, Choongbum Lee +1
On two problems in graph Ramsey theory
David Conlon, Jacob Fox, Benny Sudakov
Two remarks on the Burr-Erdos conjecture
Jacob Fox, Benny Sudakov
Sidorenko's conjecture for a class of graphs: an exposition
David Conlon, Jacob Fox, Benny Sudakov
Large subgraphs without complete bipartite graphs
David Conlon, Jacob Fox, Benny Sudakov
Erdos-Hajnal-type theorems in hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
Minimum degree condition forcing complete graph immersion
Matt DeVos, ZdenÄk DvoÅák, Jacob Fox +3
Erdos-Hajnal conjecture for graphs with bounded VC-dimension
Jacob Fox, János Pach, Andrew Suk
Dependent Random Choice
Jacob Fox, Benny Sudakov
Testing perfection is hard
Noga Alon, Jacob Fox
A short proof of the multidimensional Szemerédi theorem in the primes
Jacob Fox, Yufei Zhao
The critical window for the classical Ramsey-Turán problem
Jacob Fox, Po-Shen Loh, Yufei Zhao
Unavoidable patterns
Jacob Fox, Benny Sudakov
On graphs decomposable into induced matchings of linear sizes
Jacob Fox, Hao Huang, Benny Sudakov
Finding Cliques in Social Networks: A New Distribution-Free Model
Jacob Fox, Tim Roughgarden, C. Seshadhri +2
Cycle packing
David Conlon, Jacob Fox, Benny Sudakov
Erdos-Szekeres-type theorems for monotone paths and convex bodies
Jacob Fox, Janos Pach, Benny Sudakov +1
A relative Szemerédi theorem
David Conlon, Jacob Fox, Yufei Zhao
Popular progression differences in vector spaces
Jacob Fox, Huy Tuan Pham
Hereditary quasirandomness without regularity
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results II
David Conlon, Jacob Fox, Benny Sudakov