4 citations · 5 across the 10 of their papers we have counts for
10 papers
Directed graphs without short cycles
Jacob Fox, Peter Keevash, Benny Sudakov
For a directed graph without loops or parallel edges, let denote the size of the smallest feedback arc set, i.e., the smallest subset such that $G \sm X…
Hypergraph Ramsey numbers
David Conlon, Jacob Fox, Benny Sudakov
The Ramsey number r_k(s,n) is the minimum N such that every red-blue coloring of the k-tuples of an N-element set contains either a red set of size s or a blue set of size n, where…
Unavoidable patterns
Jacob Fox, Benny Sudakov
Let \mathcal{F}_k denote the family of 2-edge-colored complete graphs on 2k vertices in which one color forms either a clique of order k or two disjoint cliques of order k. Bollobá…
Two remarks on the Burr-Erdos conjecture
Jacob Fox, Benny Sudakov
The Ramsey number r(H) of a graph H is the minimum positive integer N such that every two-coloring of the edges of the complete graph K_N on N vertices contains a monochromatic cop…
Large induced trees in K_r-free graphs
Jacob Fox, Po-Shen Loh, Benny Sudakov
For a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G that is a tree. In this paper, we study the problem of bounding t(G) for graphs which do n…
Ramsey-type problem for an almost monochromatic K_4
Jacob Fox, Benny Sudakov
In this short note we prove that there is a constant such that every k-edge-coloring of the complete graph K_n with n > 2^{ck} contains a K_4 whose edges receive at most two co…