Jacob Fox

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 80

Top Venues

CoRR

Comb. Probab. Comput.

Comb.

Random Struct. Algorithms

Publications

Jacob Fox, Huy Tuan Pham
A multipartite analogue of Dilworth's Theorem. CoRR (2024)
Jacob Fox, János Pach, Andrew Suk
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. Eur. J. Comb. 119 (2024)
Jacob Fox, Sammy Luo, Huy Tuan Pham
On random irregular subgraphs. Random Struct. Algorithms 64 (4) (2024)
Jacob Fox, János Pach, Andrew Suk
A Structure Theorem for Pseudo-Segments and Its Applications. SoCG (2024)
Jacob Fox, Zoe M. Himwich, Nitya Mani
Extremal results on feedback arc sets in digraphs. Random Struct. Algorithms 64 (2) (2024)
David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao
Set-Coloring Ramsey Numbers and Error-Correcting Codes Near the Zero-Rate Threshold. IEEE Trans. Inf. Theory 70 (6) (2024)
David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold. CoRR (2023)
Jacob Fox, János Pach, Andrew Suk
Sunflowers in Set Systems of Bounded Dimension. Comb. 43 (1) (2023)
David Conlon, Jacob Fox, Yuval Wigderson
Three Early Problems on Size Ramsey Numbers. Comb. 43 (4) (2023)
David Conlon, Jacob Fox, Yuval Wigderson
Off-diagonal book Ramsey numbers. Comb. Probab. Comput. 32 (3) (2023)
Jacob Fox, Yuval Wigderson
Minimum degree and the graph removal lemma. J. Graph Theory 102 (4) (2023)
David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte
Hypergraph Ramsey numbers of cliques versus stars. Random Struct. Algorithms 63 (3) (2023)
Jacob Fox, Zoe Himwich, Nitya Mani
Making an H $H$ -free graph k $k$ -colorable. J. Graph Theory 102 (2) (2023)
Jacob Fox, János Pach, Andrew Suk
A structure theorem for pseudo-segments and its applications. CoRR (2023)
David Conlon, Jacob Fox, Benny Sudakov, Fan Wei
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107 (2023)
Jacob Fox, Zoe Himwich, Nitya Mani
Extremal results on feedback arc sets in digraphs. CoRR (2022)
Jacob Fox, Xiaoyu He, Sammy Luo, Max Wenqiang Xu
Multicolor list Ramsey numbers grow exponentially. J. Graph Theory 101 (3) (2022)
David Conlon, Jacob Fox, Yuval Wigderson
Ramsey Numbers of Books and Quasirandomness. Comb. 42 (3) (2022)
Jacob Fox, Yufei Zhao
Removal lemmas and approximate homomorphisms. Comb. Probab. Comput. 31 (4) (2022)
Matija Bucic, Jacob Fox, Benny Sudakov
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60 (3) (2022)
Jacob Fox, János Pach, Andrew Suk
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. GD (2022)
Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov
Powers of paths in tournaments. Comb. Probab. Comput. 30 (6) (2021)
Jacob Fox, Lisa Sauermann, Fan Wei
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices. Random Struct. Algorithms 59 (4) (2021)
John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Jacob Fox, János Pach, Andrew Suk
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. CoRR (2021)
Quentin Dubroff, Jacob Fox, Max Wenqiang Xu
A Note on the Erdös Distinct Subset Sums Problem. SIAM J. Discret. Math. 35 (1) (2021)
Jacob Fox, Cosmin Pohoata
Sets without k-term progressions can have many shorter progressions. Random Struct. Algorithms 58 (3) (2021)
Jacob Fox, János Pach, Andrew Suk
Sunflowers in Set Systems of Bounded Dimension. SoCG (2021)
Jacob Fox, Zoe Himwich, Nitya Mani
Making an $H$-Free Graph $k$-Colorable. CoRR (2021)
Jacob Fox, János Pach, Andrew Suk
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. 41 (6) (2021)
Jacob Fox, János Pach, Andrew Suk
On the Number of Edges of Separated Multigraphs. Graph Drawing (2021)
Jacob Fox, János Pach, Andrew Suk
On the number of edges of separated multigraphs. CoRR (2021)
Jacob Fox, Fan Wei
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion. SIAM J. Discret. Math. 34 (4) (2020)
Jacob Fox, Ray Li
On edge-ordered Ramsey numbers. Random Struct. Algorithms 57 (4) (2020)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. 49 (2) (2020)
Jacob Fox, Xiaoyu He, Yuval Wigderson
Ramsey, Paper, Scissors. Random Struct. Algorithms 57 (4) (2020)
Jacob Fox, Ray Li
On Ramsey numbers of hedgehogs. Comb. Probab. Comput. 29 (1) (2020)
Jacob Fox, János Pach, Andrew Suk
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. SoCG (2020)
Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95 (3) (2020)
Asaf Ferber, Jacob Fox, Vishesh Jain
Towards the linear arboricity conjecture. J. Comb. Theory, Ser. B 142 (2020)
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results III. Random Struct. Algorithms 57 (4) (2020)
David Conlon, Jacob Fox, Benny Sudakov
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34 (1) (2020)
Jacob Fox, Ray Li
On Ramsey numbers of hedgehogs. CoRR (2019)
Jacob Fox, János Pach, Andrew Suk
Approximating the rectilinear crossing number. Comput. Geom. 81 (2019)
Jacob Fox, János Pach, Andrew Suk
Semi-Algebraic Colorings of Complete Graphs. SoCG (2019)
David Conlon, Jacob Fox
Lines in Euclidean Ramsey Theory. Discret. Comput. Geom. 61 (1) (2019)
Jacob Fox, Jonathan Tidor, Yufei Zhao
Induced arithmetic removal: complexity 1 patterns over finite fields. CoRR (2019)
Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster
The removal lemma for tournaments. J. Comb. Theory, Ser. B 136 (2019)
Jacob Fox, Xiaoyu He, Freddie Manners
A proof of Tomescu's graph coloring conjecture. J. Comb. Theory, Ser. B 136 (2019)
Jacob Fox, László Miklós Lovász, Yufei Zhao
A fast new algorithm for weak graph regularity. Comb. Probab. Comput. 28 (5) (2019)
Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39 (5) (2019)
Jacob Fox, János Pach, Andrew Suk
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. 61 (4) (2019)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR (2018)
Jacob Fox, László Miklós Lovász, Lisa Sauermann
-cycle removal lemma in vector spaces. J. Comb. Theory, Ser. A 160 (2018)
Asaf Ferber, Jacob Fox, Vishesh Jain
Towards the linear arboricity conjecture. CoRR (2018)
Jacob Fox, László Miklós Lovász, Yufei Zhao
A fast new algorithm for weak graph regularity. CoRR (2018)
Jacob Fox, László Miklós Lovász, Yufei Zhao
Erratum: On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 27 (5) (2018)
Jacob Fox, Fan Wei
Fast Property Testing and Metrics for Permutations. Comb. Probab. Comput. 27 (4) (2018)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP (2018)
Jacob Fox, Lisa Sauermann
A completion of the proof of the Edge-statistics Conjecture. CoRR (2018)
Jacob Fox, János Pach, Andrew Suk
Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. 25 (4) (2018)
Jacob Fox, János Pach, Andrew Suk
More Distinct Distances Under Local Conditions. Comb. 38 (2) (2018)
Jacob Fox, Lisa Sauermann
Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions. Electron. J. Comb. 25 (2) (2018)
Jacob Fox, János Pach, Andrew Suk
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. SoCG (2017)
Jacob Fox, László Miklós Lovász, Yufei Zhao
On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 26 (4) (2017)
Jacob Fox, Fan Wei
On the Local Approach to Sidorenko's Conjecture. Electron. Notes Discret. Math. 61 (2017)
Jacob Fox, László Miklós Lovász
A tight bound for Green's arithmetic triangle removal lemma in vector spaces. SODA (2017)
David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ordered Ramsey numbers. J. Comb. Theory, Ser. B 122 (2017)
Jacob Fox, Fan Wei
Permutation Property Testing under Different Metrics with Low Query Complexity. SODA (2017)
Jacob Fox, László Miklós Lovász
A tight lower bound for Szemerédi's regularity lemma. Comb. 37 (5) (2017)
Jacob Fox, Fan Wei
On the number of cliques in graphs with a forbidden minor. J. Comb. Theory, Ser. B 126 (2017)
David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ramsey numbers of cubes versus cliques. Comb. 36 (1) (2016)
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results II. J. Comb. Theory, Ser. B 121 (2016)
Jacob Fox, János Pach, Andrew Suk
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing. SIAM J. Comput. 45 (6) (2016)
Jacob Fox, Fan Wei
On the number of cliques in graphs with a forbidden minor. CoRR (2016)
Jacob Fox, Fan Wei
Fast property testing and metrics for permutations. CoRR (2016)
Jacob Fox
Discrete Geometry, Algebra, and Combinatorics (Invited Talk). SoCG (2016)
Jacob Fox, János Pach, Andrew Suk
Approximating the rectilinear crossing number. CoRR (2016)
Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb. Theory, Ser. B 120 (2016)
Jacob Fox, János Pach, Andrew Suk
Approximating the Rectilinear Crossing Number. Graph Drawing (2016)
Jacob Fox, János Pach, Andrew Suk
Density and regularity theorems for semi-algebraic hypergraphs. SODA (2015)
Jacob Fox, Po-Shen Loh, Yufei Zhao
The critical window for the classical Ramsey-Turán problem. Comb. 35 (4) (2015)
Jacob Fox, János Pach, Andrew Suk
Semi-algebraic colorings of complete graphs. CoRR (2015)
David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky
Distinct Volume Subsets. SIAM J. Discret. Math. 29 (1) (2015)
Noga Alon, Jacob Fox
Easily Testable Graph Properties. Comb. Probab. Comput. 24 (4) (2015)
Jacob Fox, Andrey Grinshpun, János Pach
The Erdős-Hajnal conjecture for rainbow triangles. J. Comb. Theory, Ser. B 111 (2015)
Jacob Fox, János Pach, Andrew Suk
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. CoRR (2015)
Jacob Fox, János Pach
Applications of a New Separator Theorem for String Graphs. Comb. Probab. Comput. 23 (1) (2014)
David Conlon, Jacob Fox, Benny Sudakov
Cycle packing. Random Struct. Algorithms 45 (4) (2014)
Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó
What is Ramsey-equivalent to a clique? J. Comb. Theory, Ser. B 109 (2014)
Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk
On grids in topological graphs. Comput. Geom. 47 (7) (2014)
David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky
Distinct volume subsets. CoRR (2014)
David Conlon, Jacob Fox, Benny Sudakov
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23 (1) (2014)
Jacob Fox, László Miklós Lovász
A tight lower bound for Szemerédi's regularity lemma. CoRR (2014)
Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide
A minimum degree condition forcing complete graph immersion. Comb. 34 (3) (2014)
David Conlon, Jacob Fox, Benny Sudakov
An improved bound for the stepping-up lemma. Discret. Appl. Math. 161 (9) (2013)
Jacob Fox, János Pach
Applications of a new separator theorem for string graphs CoRR (2013)
Eyal Ackerman, Jacob Fox, Rom Pinchasi
A note on light geometric graphs. Discret. Math. 313 (11) (2013)
Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé
Tournaments and colouring. J. Comb. Theory, Ser. B 103 (1) (2013)
David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk
Ramsey-type results for semi-algebraic relations. SoCG (2013)

Jacob Fox.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jacob Fox