66 citations · 436 across the 112 of their papers we have counts for
143 papers
A new lower bound for two-color van der Waerden numbers
Marcelo Campos, Jacob Fox, Carl Schildkraut
The van der Waerden number is the smallest positive integer such that every two-coloring of contains a monochromatic -term arithmetic progression.…
On nearly consecutive sequences without long arithmetic progressions
Jacob Fox, Carl Schildkraut
A sequence of integers is nearly consecutive if for . We prove that there are nearly consecutive sequences of length $…
Ramsey numbers of hypergraphs of a given size
Domagoj Bradač, Jacob Fox, Benny Sudakov
The -color Ramsey number of a -uniform hypergraph is the minimum integer such that any -coloring of the complete -uniform hypergraph on vertices contains a…
Induced subgraph density. II. Sparse and dense sets in cographs
Jacob Fox, Tung Nguyen, Alex Scott +1
A well-known theorem of Rödl says that for every graph , and every , there exists such that if does not contain an induced copy of , then there exists $X\subse…
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold
David Conlon, Jacob Fox, Huy Tuan Pham +1
For positive integers with , the set-coloring Ramsey number is the minimum such that if every edge of the complete graph receives a set of c…
A note on directed analogues of the Sidorenko and forcing conjectures
Jacob Fox, Zoe Himwich, Nitya Mani +1
We study analogues of Sidorenko's conjecture and the forcing conjecture in oriented graphs, showing that natural variants of these conjectures in directed graphs are equivalent to…