Jacob Fox | Academic Influence

Jacob Fox's AcademicInfluence.com Rankings

Jacob Fox

Mathematics

#488

World Rank

#956

Historical Rank

#219

USA Rank

Measure Theory

#3092

World Rank

#3664

Historical Rank

#900

USA Rank

mathematics Degrees

Download Badge

Mathematics

Jacob Fox's Degrees

PhD Mathematics Princeton University
Bachelors Mathematics Stanford University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Jacob Fox Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jacob Fox is an American mathematician. He is a professor at Stanford University. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.

(See a Problem?)

Jacob Fox's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A new proof of the graph removal lemma (2010) (171)
Recent developments in graph Ramsey theory (2015) (152)
Overlap properties of geometric expanders (2010) (118)
Dependent random choice (2009) (115)
An Approximate Version of Sidorenko’s Conjecture (2010) (109)
Hypergraph Ramsey numbers (2008) (101)
Density theorems for bipartite graphs and related Ramsey-type results (2007) (101)
A semi-algebraic version of Zarankiewicz's problem (2014) (101)
Bounds for graph regularity and removal lemmas (2011) (100)
Graph removal lemmas (2012) (99)
A Separator Theorem for String Graphs and its Applications (2009) (73)
Stanley-Wilf limits are typically exponential (2013) (69)
The Number of Edges in k-Quasi-planar Graphs (2011) (66)
Applications of a New Separator Theorem for String Graphs (2013) (64)
Induced Ramsey-type theorems (2007) (64)
Erdős–Szekeres‐type theorems for monotone paths and convex bodies (2011) (63)
A relative Szemerédi theorem (2013) (61)
Extremal results in sparse pseudorandom graphs (2012) (55)
A minimum degree condition forcing complete graph immersion (2011) (55)
Coloring kk-free intersection graphs of geometric objects in the plane (2008) (54)
Tournaments and colouring (2012) (53)
Separator theorems and Turán-type results for planar intersection graphs (2008) (52)
Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects (2008) (49)
Computing the independence number of intersection graphs (2011) (48)
The Erdős-Hajnal conjecture for rainbow triangles (2015) (47)
On two problems in graph Ramsey theory (2010) (47)
Ramsey numbers of sparse hypergraphs (2007) (43)
Unavoidable patterns (2008) (41)
Ordered Ramsey numbers (2014) (40)
An improved bound for the stepping-up lemma (2009) (37)
A Bipartite Analogue of Dilworth’s Theorem (2006) (36)
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (2015) (36)
Finding Cliques in Social Networks: A New Distribution-Free Model (2018) (36)
Ramsey-type results for semi-algebraic relations (2013) (35)
The Erdős–Gyárfás problem on generalized Ramsey numbers (2014) (35)
Two remarks on the Burr-Erdos conjecture (2008) (35)
String graphs and incomparability graphs (2012) (33)
Complete Minors and Independence Number (2010) (33)
A tight lower bound for Szemerédi’s regularity lemma (2014) (31)
On the minimum degree of minimal Ramsey graphs (2010) (31)
Easily Testable Graph Properties (2015) (30)
Intersection patterns of curves (2011) (29)
There exist graphs with super‐exponential Ramsey multiplicity constant (2008) (28)
On grids in topological graphs (2009) (27)
A tight bound for Green's arithmetic triangle removal lemma in vector spaces (2016) (27)
On Rado's Boundedness Conjecture (2006) (27)
Ramsey-Type Problem for an Almost Monochromatic K4 (2007) (26)
The minimum degree of Ramsey‐minimal graphs (2007) (24)
The Green-Tao theorem: an exposition (2014) (23)
Short Proofs of Some Extremal Results (2012) (23)
Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension (2017) (22)
Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions (2017) (21)
Short proofs of some extremal results II (2015) (21)
Turán-type results for partial orders and intersection graphs of convex sets (2010) (20)
The critical window for the classical Ramsey-Turán problem (2012) (20)
Online Ramsey Numbers and the Subgraph Query Problem (2018) (18)
Towards Erdős-Hajnal for Graphs with No 5-Hole (2018) (17)
Cycle packing (2013) (17)
A bipartite analogue of Dilworth's theorem for multiple partial orders (2009) (17)
Crossings, Colorings, and Cliques (2009) (16)
A bipartite strengthening of the Crossing Lemma (2007) (16)
What is Ramsey-equivalent to a clique? (2013) (16)
On the grid Ramsey problem and related questions (2014) (16)
Large induced trees in Kr-free graphs (2008) (15)
On Regularity Lemmas and their Algorithmic Applications (2016) (15)
Ramsey Numbers of Books and Quasirandomness (2020) (14)
More Distinct Distances Under Local Conditions (2018) (13)
On the Local Approach to Sidorenko's Conjecture (2017) (13)
On graphs decomposable into induced matchings of linear sizes (2015) (13)
On the decay of crossing numbers (2006) (13)
Density and regularity theorems for semi-algebraic hypergraphs (2015) (12)
Efficient arithmetic regularity and removal lemmas for induced bipartite patterns (2018) (12)
Combinatorial anti-concentration inequalities, with applications (2019) (12)
A short proof of the multidimensional Szemerédi theorem in the primes (2013) (12)
Approximating the Rectilinear Crossing Number (2016) (12)
The regularity method for graphs with few 4‐cycles (2020) (12)
Towards the linear arboricity conjecture (2018) (11)
Common And Sidorenko Linear Equations (2019) (11)
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (2011) (11)
A proof of Tomescu's graph coloring conjecture (2017) (11)
Large almost monochromatic subsets in hypergraphs (2009) (11)
Triforce and corners (2019) (10)
Hedgehogs are not colour blind (2015) (10)
Erdos-Hajnal-type theorems in hypergraphs (2011) (10)
On the number of cliques in graphs with a forbidden minor (2016) (10)
Hypergraph cuts above the average (2018) (10)
Rainbow solutions to the Sidon equation (2008) (10)
A fast new algorithm for weak graph regularity (2018) (9)
Large subgraphs without complete bipartite graphs (2014) (9)
Distinct Volume Subsets (2014) (9)
Crossings between Curves with Many Tangencies (2010) (9)
On minimal colorings without monochromatic solutions to a linear equation (2010) (9)
Popular Progression Differences in Vector Spaces (2017) (8)
Hereditary quasirandomness without regularity (2016) (8)
Ramsey numbers of cubes versus cliques (2012) (8)
An infinite color analogue of Rado's theorem (2007) (8)
A Note on the Erdös Distinct Subset Sums Problem (2020) (8)
Directed Graphs Without Short Cycles (2008) (8)
Fast Property Testing and Metrics for Permutations (2016) (8)
A completion of the proof of the Edge-statistics Conjecture (2004) (8)
Erdős–Hajnal Conjecture for Graphs with Bounded VC-Dimension (2018) (8)
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces (2017) (7)
The minimum degree of Ramsey-minimal graphs (2007) (7)
On the degree of regularity of generalized van der Waerden triples. (2005) (7)
Ramsey goodness of books revisited (2021) (7)
Short proofs of some extremal results III (2019) (6)
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs (2018) (6)
On a problem of Erdös and Rothschild on edges in triangles (2012) (6)
Decompositions into Subgraphs of Small Diameter (2009) (6)
On edge‐ordered Ramsey numbers (2019) (6)
Independent sets in hypergraphs with a forbidden link (2019) (6)
Paths and Stability Number in Digraphs (2009) (6)
The removal lemma for tournaments (2017) (6)
Popular progression differences in vector spaces II (2017) (5)
Tower-type bounds for unavoidable patterns in words (2017) (5)
Maximum union-free subfamilies (2010) (5)
Constructing dense graphs with sublinear Hadwiger number (2011) (5)
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion (2016) (5)
Lines in Euclidean Ramsey Theory (2017) (5)
Anti-concentration for subgraph counts in random graphs (2019) (4)
Bounded VC-Dimension Implies the Schur-Erdős Conjecture (2019) (4)
Powers of paths in tournaments (2020) (4)
Tower-type bounds for Roth’s theorem with popular differences (2020) (4)
There exist graphs with super-exponential Ramsey multiplicity constant (2008) (4)
Sets without k‐term progressions can have many shorter progressions (2019) (4)
The Schur-Erdős problem for semi-algebraic colorings (2020) (3)
Linear forms from the Gowers uniformity norm (2013) (3)
Essays in extremal combinatorics (2012) (3)
Acyclic subgraphs of tournaments with high chromatic number (2019) (3)
Testing perfection is hard (2011) (3)
Off-diagonal book Ramsey numbers (2021) (3)
Ramsey numbers of sparse digraphs (2021) (3)
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices (2019) (3)
Ramsey multiplicity and the Tur\'an coloring (2022) (3)
Three Early Problems on Size Ramsey Numbers (2021) (3)
Clique minors in graphs with a forbidden subgraph (2020) (3)
Erratum: On Regularity Lemmas and their Algorithmic Applications (2018) (2)
Two extensions of Ramsey's theorem (2011) (2)
On a problem of Erdös and Rothschild on edges in triangles (2012) (2)
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs (2007) (2)
Books versus Triangles at the Extremal Density (2019) (2)
Semi-algebraic colorings of complete graphs (2015) (2)
Making an $H$-Free Graph $k$-Colorable (2021) (2)
A note on the clique chromatic number of geometric graphs (2018) (2)
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples (2007) (2)
Extremal and Ramsey results on graph blowups (2019) (2)
Minimum degree and the graph removal lemma (2021) (2)
Tomescu's graph coloring conjecture for $\ell$-connected graphs (2019) (2)
Sidorenko's conjecture for a class of graphs: an exposition (2012) (2)
Towards a polynomial form of R¨odl’s theorem (2022) (2)
A tight bound for Green's boolean removal lemma (2016) (2)
Independent arithmetic progressions (2019) (2)
Graph Ramsey theory (2018) (1)
Removal lemmas and approximate homomorphisms (2021) (1)
Threshold Ramsey multiplicity for paths and even cycles (2021) (1)
Induced arithmetic removal: complexity 1 patterns over finite fields (2019) (1)
A note on distinct distances (2016) (1)
Ramsey-type results for semi-algebraic relations Citation (2013) (1)
Sunflowers in Set Systems of Bounded Dimension (2021) (1)
Subset sums, completeness and colorings (2021) (1)
Crossings between curves with many tangencies in: Proc. WALCOM: Workshop on Algorithms and Computation, Lecture Notes in Computer Science 5942, Springer-Verlag, 2010, 1--8. (2010) (1)
Overlap properties of geometric expanders: extended abstract (2011) (1)
Acyclic Colorings and Subgraphs of Directed Graphs (2014) (1)
Threshold Ramsey multiplicity for odd cycles (2021) (1)
A ug 2 01 7 Popular progression differences in vector spaces (2018) (1)
Ramsey-Turán Numbers for Semi-Algebraic Graphs (2018) (1)
On Ramsey numbers of hedgehogs (2019) (1)
Multicolor list Ramsey numbers grow exponentially (2021) (1)
Ramsey, Paper, Scissors (2019) (1)
Geometric and o-minimal Littlewood–Offord problems (2021) (1)
Lecture 14: Topological Methods (2009) (1)
Hypergraph Ramsey numbers of cliques versus stars (2022) (1)
Set-coloring Ramsey numbers via codes (2022) (1)
Which graphs can be counted in $C_4$-free graphs? (2021) (1)
Permutation Property Testing under Different Metrics with Low Query Complexity (2017) (1)
On regularity lemmas and their applications (2016) (1)
The upper logarithmic density of monochromatic subset sums (2021) (0)
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (2013) (0)
On a problem of Erd\H{o}s and Rothschild on edges in triangles (2011) (0)
C O ] 2 0 A ug 2 01 9 On edge-ordered Ramsey numbers (2019) (0)
Inst I tute f o r Ma t he M a t Ics and I ts a ppl Ic a t IonsUNI v ERSIT y of M INNE S o T A (2012) (0)
On random irregular subgraphs (2022) (0)
The Clique Number of the Graph of Pairwise Sums and Products is 3 or 4 (2004) (0)
Making an H $H$ ‐free graph k $k$ ‐colorable (2022) (0)
Graph Crossing Number and Isomorphism SPUR Final Paper , Summer 2012 (2012) (0)
Lines in Euclidean Ramsey Theory (2018) (0)
C O ] 5 D ec 2 01 8 Semi-algebraic colorings of complete graphs (2018) (0)
C O ] 2 9 M ay 2 01 9 Combinatorial anti-concentration inequalities , with applications (2019) (0)
The Erd\H{o}s-Hajnal conjecture for rainbow triangles (2013) (0)
C O ] 1 8 O ct 2 01 9 Short proofs of some extremal results III (2019) (0)
Small subsets with large sumset: Beyond the Cauchy--Davenport bound (2022) (0)
Discrepancy of arithmetic progressions in grids (2021) (0)
Problems for the Barbados Graph Theory Workshop 2017 (2017) (0)
Lecture 11: the Probabilistic Method (0)
C O ] 1 3 O ct 2 01 1 Testing perfection is hard (2021) (0)
Discrepancy in modular arithmetic progressions (2021) (0)
C O ] 2 9 M ay 2 01 9 Anticoncentration for subgraph counts in random graphs (2019) (0)
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem (2021) (0)
Maximum union-free subfamilies (2012) (0)
A note on light geometric graphs (2013) (0)
Ramsey numbers of cubes versus cliques Citation (2013) (0)
A relative Szemerédi theorem (2015) (0)
A short proof of the canonical polynomial van der Waerden theorem (2020) (0)
Tournaments and colouring Citation (2012) (0)
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs (2021) (0)
Extremal results on feedback arc sets in digraphs (2022) (0)
Replication of De Neys, W., Rossi, S., & Houdé, O. (2013) at Utah Valley University (2018) (0)
A minimum degree condition forcing complete graph immersion (2014) (0)
C O ] 1 3 D ec 2 01 3 Ramsey numbers of cubes versus cliques (2013) (0)
Cycle Packing Terms of Use Cycle Packing (2014) (0)
C O ] 1 3 M ay 2 01 9 Books versus triangles at the extremal density (2019) (0)
Bounds for graph regularity and removal lemmas (2012) (0)
Distinct Volume Subsets | SIAM Journal on Discrete Mathematics | Vol. 29, No. 1 | Society for Industrial and Applied Mathematics (2015) (0)
2 Induced forests in sparse bipartite graphs (2013) (0)
The critical window for the classical Ramsey-Turán problem (2014) (0)
On the number of edges of separated multigraphs (2021) (0)
A note on directed analogues of the Sidorenko and forcing conjectures (2022) (0)
Problems for the Barbados Graph Theory Workshop (2018) (0)
On two problems in graph Ramsey theory (2012) (0)
Ramsey numbers of cubes versus cliques (2014) (0)
Ju n 20 07 Induced Ramsey-type theorems (2008) (0)
A note on the Erd\H{o}s distinct subset sums problem (2020) (0)
Discrete Geometry, Algebra, and Combinatorics (Invited Talk) (2016) (0)

This paper list is powered by the following services:

Other Resources About Jacob Fox

What Schools Are Affiliated With Jacob Fox?

Jacob Fox is affiliated with the following schools:

Image Attributions

Image Source for Jacob Fox