167 citations · 675 across the 52 of their papers we have counts for
4 papers · 1 filter
A hypergraph Turán theorem via lagrangians of intersecting families
Dan Hefetz, Peter Keevash
Let $\mc{K}_{3,3}^3$ be the 3-graph with 15 vertices and , and 11 edges , and $\{\…
Polynomial-time perfect matchings in dense hypergraphs
Peter Keevash, Fiachra Knox, Richard Mycroft
Let be a -graph on vertices, with minimum codegree at least for some fixed . In this paper we construct a polynomial-time algorithm which finds either…
Spectral extremal problems for hypergraphs
Peter Keevash, John Lenz, Dhruv Mubayi
In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria under which such results may be deduced from `strong stability' forms of the corr…
Dynamic concentration of the triangle-free process
Tom Bohman, Peter Keevash
The triangle-free process begins with an empty graph on n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We de…