Jacob Fox

According to our database1, Jacob Fox authored at least 110 papers between 2003 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A proof of Tomescu's graph coloring conjecture.
J. Comb. Theory, Ser. B, 2019

The removal lemma for tournaments.
J. Comb. Theory, Ser. B, 2019

Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
Discrete & Computational Geometry, 2019

A fast new algorithm for weak graph regularity.
Combinatorics, Probability & Computing, 2019

On Ramsey numbers of hedgehogs.
CoRR, 2019

Approximating the rectilinear crossing number.
Comput. Geom., 2019

Semi-Algebraic Colorings of Complete Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces.
J. Comb. Theory, Ser. A, 2018

Fast Property Testing and Metrics for Permutations.
Combinatorics, Probability & Computing, 2018

Erratum: On Regularity Lemmas and their Algorithmic Applications.
Combinatorics, Probability & Computing, 2018

Towards the linear arboricity conjecture.
CoRR, 2018

A completion of the proof of the Edge-statistics Conjecture.
CoRR, 2018

Finding Cliques in Social Networks: A New Distribution-Free Model.
CoRR, 2018

A fast new algorithm for weak graph regularity.
CoRR, 2018

Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions.
Electr. J. Comb., 2018

More Distinct Distances Under Local Conditions.
Combinatorica, 2018

Finding Cliques in Social Networks: A New Distribution-Free Model.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
On the number of cliques in graphs with a forbidden minor.
J. Comb. Theory, Ser. B, 2017

Ordered Ramsey numbers.
J. Comb. Theory, Ser. B, 2017

On the Local Approach to Sidorenko's Conjecture.
Electronic Notes in Discrete Mathematics, 2017

On Regularity Lemmas and their Algorithmic Applications.
Combinatorics, Probability & Computing, 2017

A tight lower bound for Szemerédi's regularity lemma.
Combinatorica, 2017

Permutation Property Testing under Different Metrics with Low Query Complexity.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A tight bound for Green's arithmetic triangle removal lemma in vector spaces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing.
SIAM J. Comput., 2016

On the minimum degree of minimal Ramsey graphs for multiple colours.
J. Comb. Theory, Ser. B, 2016

Short proofs of some extremal results II.
J. Comb. Theory, Ser. B, 2016

Fast property testing and metrics for permutations.
CoRR, 2016

On the number of cliques in graphs with a forbidden minor.
CoRR, 2016

Approximating the rectilinear crossing number.
CoRR, 2016

Ramsey numbers of cubes versus cliques.
Combinatorica, 2016

Approximating the Rectilinear Crossing Number.
Proceedings of the Graph Drawing and Network Visualization, 2016

Discrete Geometry, Algebra, and Combinatorics (Invited Talk).
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Distinct Volume Subsets.
SIAM J. Discrete Math., 2015

The Erdős-Hajnal conjecture for rainbow triangles.
J. Comb. Theory, Ser. B, 2015

Easily Testable Graph Properties.
Combinatorics, Probability & Computing, 2015

Semi-algebraic colorings of complete graphs.
CoRR, 2015

A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing.
CoRR, 2015

The critical window for the classical Ramsey-Turán problem.
Combinatorica, 2015

Density and regularity theorems for semi-algebraic hypergraphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Recent developments in graph Ramsey theory.
Proceedings of the Surveys in Combinatorics 2015, 2015

2014
Cycle packing.
Random Struct. Algorithms, 2014

What is Ramsey-equivalent to a clique?
J. Comb. Theory, Ser. B, 2014

Applications of a New Separator Theorem for String Graphs.
Combinatorics, Probability & Computing, 2014

Short Proofs of Some Extremal Results.
Combinatorics, Probability & Computing, 2014

A tight lower bound for Szemerédi's regularity lemma.
CoRR, 2014

Distinct volume subsets.
CoRR, 2014

On grids in topological graphs.
Comput. Geom., 2014

A minimum degree condition forcing complete graph immersion.
Combinatorica, 2014

2013
The Number of Edges in k-Quasi-planar Graphs.
SIAM J. Discrete Math., 2013

Tournaments and colouring.
J. Comb. Theory, Ser. B, 2013

A note on light geometric graphs.
Discrete Mathematics, 2013

An improved bound for the stepping-up lemma.
Discrete Applied Mathematics, 2013

Applications of a new separator theorem for string graphs
CoRR, 2013

Stanley-Wilf limits are typically exponential.
CoRR, 2013

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz.
Combinatorica, 2013

Ramsey-type results for semi-algebraic relations.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

Graph removal lemmas.
Proceedings of the Surveys in Combinatorics 2013, 2013

2012
Erdős-Hajnal-type theorems in hypergraphs.
J. Comb. Theory, Ser. B, 2012

Coloring Kk-free intersection graphs of geometric objects in the plane.
Eur. J. Comb., 2012

Graph removal lemmas
CoRR, 2012

Extremal results in sparse pseudorandom graphs
CoRR, 2012

On a problem of Erdös and Rothschild on edges in triangles.
Combinatorica, 2012

On two problems in graph Ramsey theory.
Combinatorica, 2012

String graphs and incomparability graphs.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Dependent random choice.
Random Struct. Algorithms, 2011

Intersection patterns of curves.
J. London Math. Society, 2011

The number of edges in k-quasi-planar graphs
CoRR, 2011

Two extensions of Ramsey's theorem
CoRR, 2011

Testing perfection is hard
CoRR, 2011

Constructing dense graphs with sublinear Hadwiger number
CoRR, 2011

Bounds for graph regularity and removal lemmas
CoRR, 2011

Erdos-Hajnal-type theorems in hypergraphs
CoRR, 2011

Computing the Independence Number of Intersection Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Overlap properties of geometric expanders.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Complete Minors and Independence Number.
SIAM J. Discrete Math., 2010

A bipartite strengthening of the Crossing Lemma.
J. Comb. Theory, Ser. B, 2010

Decompositions into Subgraphs of Small Diameter.
Combinatorics, Probability & Computing, 2010

A Separator Theorem for String Graphs and its Applications.
Combinatorics, Probability & Computing, 2010

Directed Graphs Without Short Cycles.
Combinatorics, Probability & Computing, 2010

Maximum union-free subfamilies
CoRR, 2010

A new proof of the graph removal lemma
CoRR, 2010

Overlap properties of geometric expanders
CoRR, 2010

Crossings between Curves with Many Tangencies.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009
Ramsey numbers of sparse hypergraphs.
Random Struct. Algorithms, 2009

Large induced trees in Kr-free graphs.
J. Comb. Theory, Ser. B, 2009

Two remarks on the Burr-Erdos conjecture.
Eur. J. Comb., 2009

A bipartite analogue of Dilworth's theorem for multiple partial orders.
Eur. J. Comb., 2009

Paths and Stability Number in Digraphs.
Electr. J. Comb., 2009

Crossings, Colorings, and Cliques.
Electr. J. Comb., 2009

Density theorems for bipartite graphs and related Ramsey-type results.
Combinatorica, 2009

A Separator Theorem for String Graphs and Its Applications.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

On grids in topological graphs.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Ramsey-Type Problem for an Almost Monochromatic K4.
SIAM J. Discrete Math., 2008

There exist graphs with super-exponential Ramsey multiplicity constant.
Journal of Graph Theory, 2008

On the decay of crossing numbers.
J. Comb. Theory, Ser. B, 2008

On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs.
J. Comb. Theory, Ser. B, 2008

Unavoidable patterns.
J. Comb. Theory, Ser. A, 2008

Rainbow solutions to the Sidon equation.
Discrete Mathematics, 2008

Coloring kk-free intersection graphs of geometric objects in the plane.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
The minimum degree of Ramsey-minimal graphs.
Journal of Graph Theory, 2007

An infinite color analogue of Rado's theorem.
J. Comb. Theory, Ser. A, 2007

Induced Ramsey-type theorems.
Electronic Notes in Discrete Mathematics, 2007

Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples.
Electronic Notes in Discrete Mathematics, 2007

A Bipartite Strengthening of the Crossing Lemma.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
A Bipartite Analogue of Dilworth's Theorem.
Order, 2006

On Rado's Boundedness Conjecture.
J. Comb. Theory, Ser. A, 2006

On the Decay of Crossing Numbers.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

2003
Rainbow Arithmetic Progressions and Anti-Ramsey Results.
Combinatorics, Probability & Computing, 2003


  Loading...