66 citations · 436 across the 112 of their papers we have counts for
18 papers · 1 filter
Tomescu's graph coloring conjecture for -connected graphs
John Engbers, Aysel Erey, Jacob Fox +1
Let be the number of proper -colorings of a finite simple graph . Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \le k!…
Bounded VC-dimension implies the Schur-Erdos conjecture
Jacob Fox, Janos Pach, Andrew Suk
In 1916, Schur introduced the Ramsey number , which is the minimum integer such that for any -coloring of the edges of the complete graph , there is a monochrom…
Extremal and Ramsey results on graph blowups
Jacob Fox, Sammy Luo, Yuval Wigderson
Recently, Souza introduced blowup Ramsey numbers as a generalization of bipartite Ramsey numbers. For graphs and , say if every -edge-co…
Acyclic subgraphs of tournaments with high chromatic number
Jacob Fox, Matthew Kwan, Benny Sudakov
We prove that every -vertex tournament has an acyclic subgraph with chromatic number at least , while there exists an -vertex tournament whose every acy…
Induced arithmetic removal: complexity 1 patterns over finite fields
Jacob Fox, Jonathan Tidor, Yufei Zhao
We prove an arithmetic analog of the induced graph removal lemma for complexity 1 patterns over finite fields. Informally speaking, we show that given a fixed collection of -col…
Short proofs of some extremal results III
David Conlon, Jacob Fox, Benny Sudakov
We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly f…