Skip to content

Author

Peter Keevash

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

On Kahn's flow conjecture

We prove Kahn's flow conjecture, which is a strong form of Chv\'atal's conjecture on the largest intersecting subfamily of a downset.

Peter Keevash · 1 citation · ⚡1
Preprint Oct 2026

The terminal leave in random greedy hypergraph matching

Let $G$ be the terminal graph of the random triangle-removal process started from $K_n$. We prove that $e(G)/n^{3/2}\to1/(2\sqrt2)$ in $L^2$. More generally, we obtain the analogous result for any fixed strictly $k$-balanced $k$-graph. Our main tool is a more general theorem on random greedy matchings in nearly regular...

Peter Keevash · 1 citation
Preprint Sep 2026

A non-trivial bound for 3AP-intersecting families

A family $F$ of subsets of $[n]$ is 3AP-intersecting if every two members have intersection containing a non-trivial three-term arithmetic progression. We prove that there is an absolute constant $c>0$ such that any such $F$ has size at most $(\tfrac12 - c)2^n$. This is the first non-trivial progress towards a conjectu...

Peter Keevash · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.