Publications — Jacob Fox

Submitted

On the clique number of random Cayley graphs and related topics. D. Conlon, J. Fox, H. T. Pham, L. Yepremyan.
Finer control on relative sizes of iterated sumsets. J. Fox, N. Kravitz, S. Zhang.
Ramsey and Turán numbers of sparse hypergraphs. J. Fox, M. Sankar, M. Simkin, J. Tidor, Y. Zhou.

To appear

Homogeneous structures in subset sums and non-averaging sets. D. Conlon, J. Fox, H. T. Pham. Communications of the American Mathematical Society.
Subset sums, completeness and colorings. D. Conlon, J. Fox, H. T. Pham. Journal of the European Mathematical Society.
Stanley–Wilf limits are typically exponential. J. Fox. Advances in Mathematics.
When are off-diagonal hypergraph Ramsey numbers polynomial? D. Conlon, J. Fox, B. Gunby, X. He, D. Mubayi, A. Suk, J. Verstraëte, H.-H. H. Yu. Proceedings of the American Mathematical Society.
Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures. M. Bucić, J. Fox, H. T. Pham. Bulletin of the London Mathematical Society.
The largest subgraph without a forbidden induced subgraph. J. Fox, R. Nenadov, H. T. Pham. Combinatorica.
Constructing dense graphs with sublinear Hadwiger number. J. Fox. Journal of Combinatorial Theory Series B.
Variations on Sidorenko’s conjecture in tournaments. J. Fox, Z. Himwich, N. Mani, Y. Zhou. Journal of Graph Theory.
A multipartite analogue of Dilworth’s theorem. J. Fox, H. T. Pham. Order.
A question of Erdős and Graham on Egyptian fractions. D. Conlon, J. Fox, X. He, D. Mubayi, H. T. Pham, A. Suk, J. Verstraëte. Discrete Analysis.

2026

Triangle Ramsey numbers of complete graphs. J. Fox, J. Tidor, S. Zhang. Journal of Combinatorial Theory Series B 176 (2026) 268–286.
Big line or big convex polygon. D. Conlon, J. Fox, X. He, D. Mubayi, H. T. Pham, A. Suk, J. Verstraëte. Computational Geometry 131 (2026), Paper No. 102218.

2025

On off-diagonal hypergraph Ramsey numbers. D. Conlon, J. Fox, B. Gunby, X. He, D. Mubayi, A. Suk, J. Verstraëte. International Mathematics Research Notices (2025) , No. 11, rnaf122, 22 pp.
Ramsey numbers of hypergraphs of a given size. D. Bradač, J. Fox, B. Sudakov. Mathematical Proceedings of the Cambridge Philosophical Society 178 (2025), 31–44.
A structure theorem for pseudosegments and its applications. J. Fox, J. Pach, A. Suk. Journal of Combinatorial Theory Series B 174 (2025), 99–132. (Preliminary version in SoCG 2024, Art. No. 59, 14 pp.)
Induced subgraph density. II. Sparse and dense sets in cographs. J. Fox, T. Nguyen, A. Scott, P. Seymour. European Journal of Combinatorics 124 (2025), Paper No. 104075, 14 pp.
A note on directed analogues of the Sidorenko and forcing conjectures. J. Fox, Z. Himwich, N. Mani, Y. Zhou. Electronic Journal of Combinatorics 32 (2025), P3.38.
Immersions and Albertson’s conjecture. J. Fox, J. Pach, A. Suk. 41st International Symposium on Computational Geometry (SoCG) 2025 , Art. No. 50, 10 pp.
On the number of edges of separated multigraphs. J. Fox, J. Pach, A. Suk. Journal of Graph Theory 109 (2025), 210–217. (Preliminary version in Graph Drawing 2021.)

2024

Ramsey numbers of sparse digraphs. J. Fox, X. He, Y. Wigderson. Israel Journal of Mathematics 263 (2024), 1–48.
Discrepancy of arithmetic progressions in grids. J. Fox, M. W. Xu, Y. Zhou. Mathematika 70 (2024), e12237.
Extremal results on feedback arc sets in digraphs. J. Fox, Z. Himwich, N. Mani. Random Structures & Algorithms 64 (2024), 287–308.
Small subsets with large sumset: Beyond the Cauchy–Davenport bound. J. Fox, S. Luo, H. T. Pham, Y. Zhou. Combinatorics, Probability and Computing 33 (2024), 411–431.
The growth rate of multicolor Ramsey numbers of 3-graphs. D. Bradač, J. Fox, B. Sudakov. Research in the Mathematical Sciences 11 (2024), Paper No. 52, 16 pp.
Enumeration of intersection graphs of x-monotone curves. J. Fox, J. Pach, A. Suk. Graph Drawing and Network Visualization (GD 2024), LIPIcs 320 (2024), 4:1–4:12.
On random irregular subgraphs. J. Fox, S. Luo, H. T. Pham. Random Structures & Algorithms 64 (2024), 899–917.
Set-coloring Ramsey numbers via codes. D. Conlon, J. Fox, X. He, D. Mubayi, A. Suk, J. Verstraëte. Studia Sci. Math. Hungar. 61 (2024), 1–15.
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem. J. Fox, J. Pach, A. Suk. European Journal of Combinatorics 119 (2024), Paper No. 103811, 10 pp.
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold. D. Conlon, J. Fox, H. T. Pham, Y. Zhao. IEEE Transactions on Information Theory 70 (2024), 4074–4078.

2023

Tower-type bounds for Roth’s theorem with popular differences. J. Fox, H. T. Pham, Y. Zhao. Journal of the European Mathematical Society 25 (2023), 3795–3831.
Geometric and o-minimal Littlewood–Offord problems. J. Fox, M. Kwan, H. Spink. Annals of Probability 51 (2023), 101–126.
Three early problems on size Ramsey numbers. D. Conlon, J. Fox, Y. Wigderson. Combinatorica 43 (2023), 743–768.
Sunflowers in set systems of bounded dimension. J. Fox, J. Pach, A. Suk. Combinatorica 43 (2023), 187–202. (Preliminary version in SoCG 2021, Art. No. 37, 13 pp.)
Hypergraph Ramsey numbers of cliques versus stars. D. Conlon, J. Fox, X. He, D. Mubayi, A. Suk, J. Verstraëte. Random Structures & Algorithms 63 (2023), 610–623.
Ramsey multiplicity and the Turán coloring. J. Fox, Y. Wigderson. Advances in Combinatorics (2023), Paper No. 2, 39 pp.
Off-diagonal book Ramsey numbers. D. Conlon, J. Fox, Y. Wigderson. Combinatorics, Probability and Computing 32 (2023), 516–545.
Ramsey goodness of books revisited. J. Fox, X. He, Y. Wigderson. Advances in Combinatorics (2023), Paper No. 4, 21 pp.
Minimum degree and the graph removal lemma. J. Fox, Y. Wigderson. Journal of Graph Theory 102 (2023), 648–665.
Making an H-free graph k-colorable. J. Fox, Z. Himwich, N. Mani. Journal of Graph Theory 102 (2023), 234–261.
Threshold Ramsey multiplicity for paths and even cycles. D. Conlon, J. Fox, B. Sudakov, F. Wei. European Journal of Combinatorics 107 (2023), Paper No. 103612, 27 pp.

2022

Discrepancy in modular arithmetic progressions. J. Fox, M. W. Xu, Y. Zhou. Compositio Mathematica 158 (2022), 2082–2108.
Induced arithmetic removal: complexity 1 patterns over finite fields. J. Fox, J. Tidor, Y. Zhao. Israel Journal of Mathematics 248 (2022), 1–38.
The upper logarithmic density of monochromatic subset sums. D. Conlon, J. Fox, H. T. Pham. Mathematika 68 (2022), 1292–1301.
Which graphs can be counted in C4-free graphs? D. Conlon, J. Fox, B. Sudakov, Y. Zhao. Pure and Applied Mathematics Quarterly 18 (2022), 2413–2432.
Ramsey numbers of books and quasirandomness. D. Conlon, J. Fox, Y. Wigderson. Combinatorica 42 (2022), 309–363.
Removal lemmas and approximate homomorphisms. J. Fox, Y. Zhao. Combinatorics, Probability and Computing 31 (2022), 721–736.
Threshold Ramsey multiplicity for odd cycles. D. Conlon, J. Fox, F. Wei. Revista de la Unión Matemática Argentina 64 (2022), 49–68.
Clique minors in graphs with a forbidden subgraph. M. Bucić, J. Fox, B. Sudakov. Random Structures & Algorithms 60 (2022), 327–338.
Multicolor list Ramsey numbers grow exponentially. J. Fox, X. He, S. Luo, M. W. Xu. Journal of Graph Theory 101 (2022), 389–396.

2021

Independent sets in hypergraphs with a forbidden link. J. Fox, X. He. Proceedings of the London Mathematical Society 123 (2021), 384–409.
Popular progression differences in vector spaces. J. Fox, H. T. Pham. International Mathematics Research Notices 2021 (7), 5261–5289.
The regularity method for graphs with few 4-cycles. D. Conlon, J. Fox, B. Sudakov, Y. Zhao. Journal of the London Mathematical Society 104 (2021), 2376–2401.
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices. J. Fox, L. Sauermann, F. Wei. Random Structures and Algorithms 59 (2021), 554–615.
Anti-concentration for subgraph counts in random graphs. J. Fox, M. Kwan, L. Sauermann. Annals of Probability 49 (2021), 1515–1553.
Combinatorial anti-concentration inequalities, with applications. J. Fox, M. Kwan, L. Sauermann. Mathematical Proceedings of the Cambridge Philosophical Society 171 (2021), 227–248.
Bounded VC-Dimension Implies the Schur–Erdős Conjecture. J. Fox, J. Pach, A. Suk. Combinatorica 41 (2021), 803–813. (Prelim. in SoCG 2020.)
Common and Sidorenko linear equations. J. Fox, H. T. Pham, Y. Zhao. Quarterly Journal of Mathematics 72 (2021), 1223–1234.
Powers of paths in tournaments. N. Draganić, F. Dross, J. Fox, A. Girão, F. Havet, D. Korándi, W. Lochet, D. M. Correia, A. Scott, B. Sudakov. Combinatorics, Probability and Computing 30 (2021), 894–898.
Tomescu’s graph coloring conjecture for ℓ-connected graphs. J. Engbers, A. Erey, J. Fox, X. He. SIAM Journal on Discrete Mathematics 35 (2021), 1478–1502.
Sets without k-term progressions can have many shorter progressions. J. Fox, C. Pohoata. Random Structures & Algorithms 58 (2021), 383–389.
Extremal and Ramsey results on graph blowups. J. Fox, S. Luo, Y. Wigderson. Journal of Combinatorics 12 (2021), 1–15.
Acyclic subgraphs of tournaments with high chromatic number. J. Fox, M. Kwan, B. Sudakov. Bulletin of the London Mathematical Society 53 (2021), 619–630.
A note on the Erdős distinct subset sums problem. Q. Dubroff, J. Fox, M. W. Xu. SIAM Journal on Discrete Mathematics 35 (2021), 322–324.

2020

The Schur-Erdős problem for semi-algebraic colorings. J. Fox, J. Pach, A. Suk. Israel Journal of Mathematics 239 (2020), 39–57.
On the number of cliques in graphs with a forbidden subdivision or immersion. J. Fox and F. Wei. SIAM Journal of Discrete Mathematics 34 (2020), 2556–2582.
A short proof of the canonical polynomial van der Waerden theorem. J. Fox, Y. Wigderson, Y. Zhao. C. R. Math. 358 (2020), 957–959.
Pure Pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. M. Chudnovsky, J. Fox, A. Scott, P. Seymour, S. Spirkl. Journal of Graph Theory 95 (2020), 315–340.
A completion of the proof of the Edge-statistics Conjecture. J. Fox, L. Sauermann. Advances in Combinatorics (2020), Paper No. 4, 52 pp.
Triforce and Corners. J. Fox, A. Sah, M. Sawhney, D. Stoner, and Y. Zhao. Mathematical Proceedings of the Cambridge Philosophical Society 169 (2020), 209–223.
Finding Cliques in Social Networks: A New Distribution-Free Model. J. Fox, T. Roughgarden, C. Seshadhri, F. Wei, N. Wein. SIAM Journal on Computing 49 (2020), 448–464. (Conf. version ICALP 2018.)
Towards the linear arboricity conjecture. A. Ferber, J. Fox, V. Jain. Journal of Combinatorial Theory Series B 142 (2020), 56–79.
On edge-ordered Ramsey numbers. J. Fox, R. Li. Random Structures & Algorithms 57 (2020), 1174–1204.
Books versus triangles at the extremal density. D. Conlon, J. Fox, B. Sudakov. SIAM Journal on Discrete Mathematics 34 (2020), 385–398.
Ramsey, Paper, Scissors. J. Fox, X. He, Y. Wigderson. Random Structures & Algorithms 57 (2020), 1157–1173.
On Ramsey numbers of hedgehogs. J. Fox and R. Li. Combinatorics, Probabability, and Computing 29 (2020), 101–112.
Online Ramsey Numbers and the Subgraph Query Problem. D. Conlon, J. Fox, A. Grinshpun, X. He. In: Building Bridges II, BSM Studies 28, Springer (2020), 159–194.
Short proofs of some extremal results III. D. Conlon, J. Fox, B. Sudakov. Random Structures & Algorithms 57 (2020), 958–982.

2019

Hypergraph cuts above the average. D. Conlon, J. Fox, M. Kwan, B. Sudakov. Israel Journal of Mathematics 233 (2019), 67–111.
Tower-type bounds for unavoidable patterns in words. D. Conlon, J. Fox, B. Sudakov. Transactions of the American Mathematical Society 372 (2019), 6213–6229.
Lines in Euclidean Ramsey theory. D. Conlon, J. Fox. Discrete & Computational Geometry 61 (2019), 218–225.
A proof of Tomescu’s graph coloring conjecture. J. Fox, X. He, F. Manners. Journal of Combinatorial Theory Series B 136 (2019), 204–221.
A fast new algorithm for weak graph regularity. J. Fox, L. M. Lovász, Y. Zhao. Combinatorics, Probability and Computing 28 (2019), 777–790.
Approximating the rectilinear crossing number. J. Fox, J. Pach, A. Suk. Computational Geometry 81 (2019), 45–53. (Preliminary version in GD 2016.)
Popular progression differences in vector spaces II. J. Fox, H. T. Pham. Discrete Analysis (2019), Paper No. 16, 39 pp.
Efficient arithmetic regularity and removal lemmas for induced bipartite patterns. N. Alon, J. Fox, Y. Zhao. Discrete Analysis (2019), Paper No. 3, 14 pp.
Erdős–Hajnal conjecture for graphs with bounded VC-dimension. J. Fox, J. Pach, A. Suk. Discrete & Computational Geometry 61 (2019), 809–829. (Preliminary version in SoCG 2017.)
The removal lemma for tournaments. J. Fox, L. Gishboliner, A. Shapira, R. Yuster. Journal of Combinatorial Theory Series B 136 (2019), 110–134.
Semi-algebraic colorings of complete graphs. J. Fox, J. Pach, A. Suk. Symposium on Computational Geometry (SoCG) 2019.
Towards Erdős–Hajnal for graphs with no 5-hole. M. Chudnovsky, J. Fox, A. Scott, P. Seymour, S. Spirkl. Combinatorica 39 (2019), 983–991.

2018

Hereditary quasirandomness without regularity. D. Conlon, J. Fox, B. Sudakov. Mathematical Proceedings of the Cambridge Philosophical Society 164 (2018), 385–399.
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces. J. Fox, L. M. Lovász, L. Sauermann. Journal of Combinatorial Theory Series A 160 (2018), 186–201.
Fast property testing and metrics for permutations. J. Fox, F. Wei. Combinatorics, Probability and Computing 27 (2018), 539–579.
More distinct distances under local conditions. J. Fox, J. Pach, A. Suk. Combinatorica 38 (2018), 501–509.
Erdős–Ginzburg–Ziv constants by avoiding three-term arithmetic progressions. J. Fox, L. Sauermann. Electronic Journal of Combinatorics 25 (2018), Paper 2.14, 9 pp.
Ramsey–Turán numbers for semi-algebraic graphs. J. Fox, J. Pach, A. Suk. Electronic Journal of Combinatorics 25 (2018), Paper 4.61, 5 pp.
A note on the clique chromatic number of geometric graphs. J. Fox, J. Pach, A. Suk. Geombinatorics 28 (2018), 83–86.

2017

A tight bound for Green’s arithmetic triangle removal lemma in vector spaces. J. Fox, L. M. Lovász. Advances in Mathematics 321 (2017), 287–297.
A semi-algebraic version of Zarankiewicz’s problem. J. Fox, J. Pach, A. Sheffer, A. Suk, J. Zahl. Journal of the European Mathematical Society 19 (2017), 1785–1810.
A tight lower bound for Szemerédi’s regularity lemma. J. Fox, L. M. Lovász. Combinatorica 37 (2017), 911–951.
On the number of cliques in graphs with a forbidden minor. J. Fox, F. Wei. Journal of Combinatorial Theory Series B 126 (2017), 175–197.
On graphs decomposable into induced matchings of linear sizes. J. Fox, H. Huang, B. Sudakov. Bulletin of the London Mathematical Society 49 (2017), 45–57.
On regularity lemmas and their algorithmic applications. J. Fox, L. M. Lovász, Y. Zhao. Combinatorics, Probability and Computing 26 (2017), 481–505.
Hedgehogs are not colour blind. D. Conlon, J. Fox, V. Rödl. Journal of Combinatorics 8 (2017), 475–485.
Permutation property testing under different metrics with low query complexity. J. Fox, F. Wei. SODA 2017, 1618–1637.
Ordered Ramsey numbers. D. Conlon, J. Fox, C. Lee, B. Sudakov. Journal of Combinatorial Theory Series B 122 (2017), 353–383.

2016

A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. J. Fox, J. Pach, A. Suk. SIAM Journal on Computing 45 (2016), 2199–2223. (Preliminary version in SODA 2015.)
Short proofs of some extremal results II. D. Conlon, J. Fox, B. Sudakov. Journal of Combinatorial Theory Series B 121 (2016), 173–196.
Ramsey numbers of cubes versus cliques. D. Conlon, J. Fox, C. Lee, B. Sudakov. Combinatorica 36 (2016), 37–70.
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Fox, A. Grinshpun, A. Liebenau, Y. Person, T. Szabó. Journal of Combinatorial Theory Series B 120 (2016), 64–82.

2015

A relative Szemerédi theorem. D. Conlon, J. Fox, Y. Zhao. Geometric and Functional Analysis 25 (2015), 733–762.
A short proof of the multidimensional Szemerédi theorem in the primes. J. Fox, Y. Zhao. American Journal of Mathematics 137 (2015), 1139–1145.
The Erdős–Gyárfás problem on generalized Ramsey numbers. D. Conlon, J. Fox, C. Lee, B. Sudakov. Proceedings of the London Mathematical Society 110 (2015), 1–18.
On the grid Ramsey problem and related questions. D. Conlon, J. Fox, C. Lee, B. Sudakov. International Mathematics Research Notices (2015), 8052–8084.
The critical window for the classical Ramsey–Turán problem. J. Fox, P.-S. Loh, Y. Zhao. Combinatorica 35 (2015), 435–476.
Easily testable graph properties. N. Alon, J. Fox. Combinatorics, Probability and Computing 24 (2015), 646–657.
Distinct volume subsets. D. Conlon, J. Fox, W. Gasarch, D. G. Harris, D. Ulrich, S. Zbarsky. SIAM Journal on Discrete Mathematics 29 (2015), 472–480.
Recent developments in graph Ramsey theory. D. Conlon, J. Fox, B. Sudakov. Surveys in Combinatorics 2015, London Math. Soc. Lecture Note Ser., Cambridge Univ. Press, 49–118.
The Erdős–Hajnal conjecture for rainbow triangles. J. Fox, A. Grinshpun, J. Pach. Journal of Combinatorial Theory Series B 111 (2015), 75–125.

2014

Extremal results in sparse pseudorandom graphs. D. Conlon, J. Fox, Y. Zhao. Advances in Mathematics 256 (2014), 206–290.
The Green–Tao theorem: an exposition. D. Conlon, J. Fox, Y. Zhao. EMS Surveys in Mathematical Sciences 1 (2014), 249–282.
Ramsey-type results for semi-algebraic relations. D. Conlon, J. Fox, J. Pach, B. Sudakov, A. Suk. Transactions of the American Mathematical Society 366 (2014), 5043–5065. (Preliminary version in SoCG.)
The graph regularity method: variants, applications, and alternative methods. J. Fox. Proceedings of the International Congress of Mathematicians (2014), Vol. 4, 329–354.
Cycle packing. D. Conlon, J. Fox, B. Sudakov. Random Structures & Algorithms 45 (2014), 608–626.
What is Ramsey-equivalent to a clique? J. Fox, A. Grinshpun, A. Liebenau, Y. Person, T. Szabó. Journal of Combinatorial Theory Series B 109 (2014), 120–133.
Minimum degree condition forcing complete graph immersion. M. DeVos, Z. Dvořák, J. Fox, J. McDonald, B. Mohar, D. Scheide. Combinatorica 34 (2014), 279–298.
Short proofs of some extremal results. D. Conlon, J. Fox, B. Sudakov. Combinatorics, Probability and Computing 23 (2014), 8–28.
Applications of a new separator theorem for string graphs. J. Fox, J. Pach. Combinatorics, Probability and Computing 23 (2014), 66–74.
On grids in topological graphs. E. Ackerman, J. Fox, J. Pach, A. Suk. Computational Geometry 47 (2014), 710–723.

2013

Two extensions of Ramsey’s theorem. D. Conlon, J. Fox, B. Sudakov. Duke Mathematical Journal 162 (2013).
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős–Fajtlowicz. J. Fox, C. Lee, B. Sudakov. Combinatorica 33 (2013), 181–197.
Tournaments and colouring. E. Berger, K. Choromanski, M. Chudnovsky, J. Fox, M. Loebl, A. Scott, P. Seymour, S. Thomassé. Journal of Combinatorial Theory Series B 103 (2013), 1–20.
Graph removal lemmas. D. Conlon, J. Fox. Surveys in Combinatorics, CUP (2013), 1–50.
The number of edges in k-quasi-planar graphs. J. Fox, J. Pach, A. Suk. SIAM Journal on Discrete Mathematics 27 (2013), 550–561.
An improved bound for the stepping-up lemma. D. Conlon, J. Fox, B. Sudakov. Discrete Applied Mathematics 161 (2013), 1191–1196.
A note on light geometric graphs. E. Ackerman, J. Fox, R. Pinchasi. Discrete Mathematics 313 (2013), 1281–1283.

2012

Bounds for graph regularity and removal lemmas. D. Conlon, J. Fox. Geometric and Functional Analysis 22 (2012), 1191–1256.
Maximum union-free subfamilies. J. Fox, C. Lee, B. Sudakov. Israel Journal of Mathematics 191 (2012), 959–971.
String graphs and incomparability graphs. J. Fox, J. Pach. Advances in Mathematics 230 (2012), 1381–1401.
Overlap properties of geometric expanders. J. Fox, M. Gromov, V. Lafforgue, A. Naor, J. Pach. Journal für die reine und angewandte Mathematik 671 (2012), 49–83.
Erdős–Szekeres-type theorems for monotone paths and convex bodies. J. Fox, J. Pach, B. Sudakov, A. Suk. Proceedings of the London Mathematical Society 105 (2012), 953–982.
On a problem of Erdős and Rothschild on edges in triangles. J. Fox, P.-S. Loh. Combinatorica 32 (2012), 619–628.
On two problems in graph Ramsey theory. D. Conlon, J. Fox, B. Sudakov. Combinatorica 32 (2012), 513–535.
Erdős–Hajnal-type theorems in hypergraphs. D. Conlon, J. Fox, B. Sudakov. Journal of Combinatorial Theory Series B 102 (2012), 1142–1154.
Coloring K_k-free intersection graphs of geometric objects in the plane. J. Fox, J. Pach. European Journal of Combinatorics 33 (2012), 853–866.

2011

A new proof of the graph removal lemma. J. Fox. Annals of Mathematics 174 (2011), 561–579.
Large almost monochromatic subsets in hypergraphs. D. Conlon, J. Fox, B. Sudakov. Israel Journal of Mathematics 181 (2011), 423–432.
Dependent random choice. J. Fox and B. Sudakov. Random Structures and Algorithms 38 (2011), 68–99.
Intersection patterns of curves. J. Fox, J. Pach, C. D. Tóth. Journal of the London Mathematical Society 83 (2011), 389–406.
Computing the independence number of intersection graphs. J. Fox and J. Pach. SODA 2011, 1161–1165.

2010

Hypergraph Ramsey numbers. D. Conlon, J. Fox, B. Sudakov. Journal of the American Mathematical Society 23 (2010), 247–266.
An approximate version of Sidorenko’s conjecture. D. Conlon, J. Fox, B. Sudakov. Geometric and Functional Analysis 20 (2010), 1354–1366.
Turán-type results for partial orders and intersection graphs of convex sets. J. Fox, J. Pach, C. D. Tóth. Israel Journal of Mathematics 178 (2010), 29–50.
A bipartite strengthening of the Crossing Lemma. J. Fox, J. Pach, and Cs. D. T´oth. Journal of Combinatorial Theory Series B, 100 (2010), 23–35. (Preliminary version in Graph Drawing 2007).
Complete minors and independence number. J. Fox. SIAM Journal on Discrete Mathematics 24 (2010), 1313–1321.
Decompositions into subgraphs of small diameter. J. Fox and B. Sudakov. Combinatorics, Probability, and Computing 19 (2010), 753–774.
A separator theorem for string graphs and its applications. J. Fox, J. Pach. Combinatorics, Probability and Computing 19 (2010), 371–390.
Directed graphs without short cycles. J. Fox, P. Keevash, B. Sudakov. Combinatorics, Probability and Computing 19 (2010), 285–301.
Crossings between curves with many tangencies. J. Fox, F. Frati, R. Pinchasi, and J. Pach. Proc. WALCOM: Workshop on Algorithms and Computation, Lecture Notes in Computer Science 5942, Springer-Verlag (2010), 1–8.

2009

Density theorems for bipartite graphs and related Ramsey-type results. J. Fox, B. Sudakov. Combinatorica 29 (2009), 153–196.
Ramsey numbers of sparse hypergraphs. D. Conlon, J. Fox, B. Sudakov. Random Structures & Algorithms 35 (2009), 1–14.
Large induced trees in K_r-free graphs. J. Fox, P.-S. Loh, B. Sudakov. Journal of Combinatorial Theory Series B 99 (2009), 494–501.
Two remarks on the Burr–Erdős conjecture. J. Fox, B. Sudakov. European Journal of Combinatorics 30 (2009), 1630–1645.
Paths and stability number in digraphs. J. Fox, B. Sudakov. Electronic Journal of Combinatorics 16 (2009), N23.
Crossings, colorings, and cliques. M. O. Albertson, D. W. Cranston, J. Fox. Electronic Journal of Combinatorics 16 (2009), R45.

2008

Induced Ramsey-type theorems. J. Fox, B. Sudakov. Advances in Mathematics 219 (2008), 1771–1800.
Separator theorems and Turán-type results for planar intersection graphs. J. Fox, J. Pach. Advances in Mathematics 219 (2008), 1070–1080.
On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs. J. Fox, B. Sudakov. Journal of Combinatorial Theory Series B 98 (2008), 1056–1062.
Ramsey-type problem for an almost monochromatic K₄. J. Fox, B. Sudakov. SIAM Journal on Discrete Mathematics 23 (2008), 155–162.
Erdős–Hajnal-type results on intersection patterns of geometric objects. J. Fox, J. Pach. In: Horizons of Combinatorics, Bolyai Soc. Math. Stud. 17 (2008), 79–103.
Unavoidable patterns. J. Fox, B. Sudakov. Journal of Combinatorial Theory Series A 115 (2008), 1561–1569.

Undergraduate research

A Bipartite Analogue of Dilworth’s Theorem for Multiple Partial Orders. J. Fox, J. Pach. European Journal of Combinatorics 30 (2009), 1846–1853.
On the decay of crossing numbers. J. Fox, C. D. Tóth. Journal of Combinatorial Theory Series B 98 (2008), 33–42. (Preliminary version in Graph Drawing 2006.)
There exist graphs with super-exponential Ramsey multiplicity constant. J. Fox. Journal of Graph Theory 57 (2008), 89–98.
Rainbow Solutions to the Sidon Equation. J. Fox, M. Mahdian, R. Radoičić. Discrete Mathematics 308 (2008), 4773–4778.
An infinite color analogue of Rado’s theorem. J. Fox. Journal of Combinatorial Theory Series A 114 (2007), 1456–1469.
On minimal colorings without monochromatic solutions to a linear equation. B. Alexeev, J. Fox, R. Graham. Integers 7(2) (2007), A1.
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples. J. Fox, V. Jungić, R. Radoičić. Integers 7(2) (2007), A12.
The Minimum Degree of Ramsey Minimal Graphs. J. Fox, K. Lin. Journal of Graph Theory 54 (2007), 167–177.
A Bipartite Analogue of Dilworth’s Theorem. J. Fox. Order 23 (2006), 197–209.
On Rado’s Boundedness Conjecture. J. Fox, D. J. Kleitman. Journal of Combinatorial Theory Series A 113 (2006), 84–100.
On the Degree of Regularity of Generalized van der Waerden Triples. J. Fox, R. Radoičić. Integers 5 (2005), A32.
Rainbow Arithmetic Progressions and Anti-Ramsey Results. V. Jungić, J. Licht (Fox), M. Mahdian, J. Nešetřil, R. Radoičić. Combinatorics, Probability and Computing 12 (2003), 599–620.