Publications

Here is a list of my publications.

Preprints:

  • String graphs and incomparability graphs. J. Fox and J. Pach.
  • Complete minors and independence number. J. Fox.
  • An improved bound for the stepping-up lemma. D. Conlon, J. Fox, and B. Sudakov.
  • Decompositions into subgraphs of small diameter. J. Fox and B. Sudakov.
  • Directed graphs without short cycles. J. Fox, P. Keevash, and B. Sudakov.

    • To appear:

  • Hyergraph Ramsey numbers. D. Conlon, J. Fox, and B. Sudakov, J. Amer. Math. Soc.
  • Large almost monochromatic subsets in hypergraphs. D. Conlon, J. Fox, and B. Sudakov, Israel J. Math.
  • A separator theorem for string graphs and its applications. J. Fox and J. Pach, Combinatorics, Probability and Computing.
  • A bipartite strengthening of the Crossing Lemma. J. Fox, J. Pach, and Cs. D. Tóth, J. Combinatorial Theory Ser. B. A preliminary version appeared in Proc. 15th Sympos. on Graph Drawing (Sydney, 2007), vol. 4875 of LNCS, Springer, 2008, 13-24.
  • Intersection patterns of curves. J. Fox, J. Pach, and Cs. D. Tóth, J. London Mathematical Society.
  • Turán-type results for partial orders and intersection graphs of convex sets. J. Fox, J. Pach, and Cs. D. Tóth, Israel J. Math.
  • A Bipartite Analogue of Dilworth’s Theorem for Multiple Partial Orders. J. Fox and J. Pach, European J. Combinatorics.

    • 2009:

  • Density theorems for bipartite graphs and related Ramsey-type results. J. Fox and B. Sudakov, Combinatorica 29 (2009), 153-196.
  • Ramsey numbers of sparse hypergraphs. D. Conlon, J. Fox, and B. Sudakov, Random Structures and Algorithms 35 (2009), 1-14.
  • Large induced trees in K_r-free graphs. J. Fox, P. Loh, and B. Sudakov, J. Combinatorial Theory Ser. B 99 (2009), 494-501.
  • Two remarks on the Burr-Erdos conjecture. J. Fox and B. Sudakov, European J. Combinatorics 30 (2009), 1630-1645.
  • Paths and stability number in digraphs. J. Fox and B. Sudakov, Electronic J. Combinatorics 16 (2009), N23.
  • Crossings, colorings, and cliques. M. O. Albertson, D. W. Cranston, and J. Fox, Electronic J. Combinatorics 16 (2009), R45.
  • On grids in topological graphs. E. Ackerman, J. Fox, J. Pach, and A. Suk, Proc. 25th ACM Sympos. on Computational Geometry (2009), 403-412.

    • 2008:

  • Induced Ramsey-type theorems. J. Fox and B. Sudakov, Advances in Mathematics 219 (2008), 1771-1800.
  • Separator theorems and Turán-type results for planar intersection graphs. J. Fox and J. Pach, Advances in Mathematics 219 (2008), 1070-1080.
  • On a problem of Duke, Erdos, and Rödl on cycle-connected subgraphs. J. Fox and B. Sudakov, J. Combinatorial Theory Ser. B 98 (2008), 1056-1062.
  • Coloring K_k-free intersection graphs of geometric objects in the plane. J. Fox and J. Pach, Proc. 24th ACM Sympos. on Computational Geometry (2008), 346-354.
  • Ramsey-type problem for an almost monochromatic K_4. J. Fox and B. Sudakov, SIAM J. Discrete Math. 23 (2008), 155-162.
  • Erdos-Hajnal-type results on intersection patterns of geometric objects. J. Fox and J. Pach, Horizon of Combinatorics (G.O.H. Katona et al., eds.), Bolyai Society Studies in Mathematics, Springer (2008), 79-103.
  • Unavoidable patterns. J. Fox and B. Sudakov, J. Combinatorial Theory Ser. A 115 (2008), 1561-1569.

    • Prior to graduate school:

  • On the decay of crossing numbers. J. Fox and Cs. D. Tóth, J. Combinatorial Theory Ser. B 98 (2008), 33-42. Also in Proc. 14th Sympos. on Graph Drawing (Karlsruhe, 2006), vol. 4372 of LNCS, Springer-Verlag, 174-183.
  • There Exist Graphs with Super-Exponential Ramsey Multiplicity Constant. J. Fox, J. Graph Theory 57 (2008), 89-98.
  • Rainbow Solutions to the Sidon Equation. J. Fox, M. Mahdian, and R. Radoicic, Discrete Mathematics 308 (2008), 4773-4778.
  • An infinite color analogue of Rado’s theorem. J. Fox, J. Combinatorial Theory Ser. A 114 (2007), 1456-1469.
  • Minimal colorings without monochromatic solutions to a linear equation. B. Alexeev, J. Fox, and R. Graham, Integers 7(2) (2007), A1.
  • Sub-Ramsey numbers for arithmetic progressions and the Sidon equation. J. Fox, V. Jungic, and R. Radoicic, Integers 7(2) (2007), A12.
  • The Minimum Degree of Ramsey Minimal Graphs. J. Fox and K. Lin, J. 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 and D. J. Kleitman, J. Combinatorial Theory Ser. A 113 (2006), 84-100.
  • On the Degree of Regularity of Generalized van der Waerden Triples. J. Fox and R. Radoicic, Integers 5 (2005), A32.
  • Rainbow Arithmetic Progressions and Anti-Ramsey Results. V. Jungic, J. Licht (Fox), M. Mahdian, J. Nesetril, and R. Radoicic, Combinatorics, Probability, and Computing 12 (2003), 599-620.

    •