9 citations · 29 across the 37 of their papers we have counts for
6 papers · 1 filter
Three early problems on size Ramsey numbers
David Conlon, Jacob Fox, Yuval Wigderson
The size Ramsey number of a graph is defined as the minimum number of edges in a graph such that there is a monochromatic copy of in every two-coloring of . The s…
Off-diagonal book Ramsey numbers
David Conlon, Jacob Fox, Yuval Wigderson
The book graph consists of copies of joined along a common . In the prequel to this paper, we studied the diagonal Ramsey number $r(B_n^{(k)}, B_n^{(…
Ramsey goodness of books revisited
Jacob Fox, Xiaoyu He, Yuval Wigderson
The Ramsey number is the minimum such that every graph on vertices contains as a subgraph or its complement contains as a subgraph. For integers $n \geq k…
Paley-like graphs for the Ramsey number
Yuval Wigderson
An earlier version of this paper constructed a family of -vertex -free graphs which we conjectured to have independence number . This conjecture is false…
Minimum degree and the graph removal lemma
Jacob Fox, Yuval Wigderson
The clique removal lemma says that for every and , there exists some so that every -vertex graph with fewer than copies of can b…
Ramsey numbers of sparse digraphs
Jacob Fox, Xiaoyu He, Yuval Wigderson
Burr and Erdős in 1975 conjectured, and Chvátal, Rödl, Szemerédi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. I…