6 papers · 1 filter
Three-color van der Waerden numbers grow super-exponentially
Jacob Fox, Zach Hunter
For sufficiently large, we show that there is a three-coloring of the first positive integers without any monochromatic -term arithmetic progressions. T…
A note on the Alon-Saks-Seymour problem
Jacob Fox
Let be the maximum possible chromatic number of a graph whose edge set can be partitioned into at most complete bipartite graphs. Alon, Saks, and Seymour conjectured tha…
Finding blowups one vertex at a time
Jacob Fox, Yuval Wigderson, Yunkun Zhou
An influential theorem of Nikiforov states that if an -vertex graph contains at least copies of some fixed -vertex graph , then contains an -blowup of o…
Coloring small locally sparse degenerate graphs and related problems
Domagoj BradaÄ, Jacob Fox, Raphael Steiner +2
The classic upper bound on the chromatic number of -degenerate graphs is , shown to be tight by complete graphs. A natural question is whether this bound remains tight if o…
Color-avoiding directed paths in tournaments
Jacob Fox, Benny Sudakov, Yuval Wigderson
We study the following Ramsey-theoretic question: given a -coloring of the edges of a tournament, how long of a directed path can we guarantee whose edges avoid one of the color…
The growth rate of multicolor Ramsey numbers of -graphs
Domagoj BradaÄ, Jacob Fox, Benny Sudakov
The -color Ramsey number of a -uniform hypergraph denoted , is the minimum integer such that any coloring of the edges of the complete -uniform hypergraph…