167 citations · 675 across the 52 of their papers we have counts for
64 papers
On Kahn's flow conjecture
Peter Keevash
We prove Kahn's flow conjecture, which is a strong form of Chvátal's conjecture on the largest intersecting subfamily of a downset.
On the length of directed paths in digraphs
Yangyang Cheng, Peter Keevash
Thomassé conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree and girth contains a directed path of…
Long induced paths in expanders
Nemanja Draganić, Peter Keevash
We prove that any bounded degree regular graph with sufficiently strong spectral expansion contains an induced path of linear length. This is the first such result for expanders, s…
Sharp bounds for the Tao-Vu Discrete John's Theorem
Peter van Hintum, Peter Keevash
Tao and Vu showed that every centrally symmetric convex progression is contained in a generalised arithmetic progression of size . Berg and…
Sharp hypercontractivity for symmetric groups and its applications
Peter Keevash, Noam Lifshitz
A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties suc…
On Ruzsa's discrete Brunn-Minkowski conjecture
Peter van Hintum, Peter Keevash, Marius Tiba
We prove a conjecture by Ruzsa from 2006 on a discrete version of the Brunn-Minkowski inequality, stating that for any and with not contained in…