167 citations · 675 across the 52 of their papers we have counts for
6 papers · 1 filter
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…
A hypergraph regularity method for generalised Turan problems
Peter Keevash
We describe a method that we believe may be foundational for a comprehensive theory of generalised Turan problems. The cornerstone of our approach is a quasirandom counting lemma f…
Loose Hamilton cycles in hypergraphs
Peter Keevash, Daniela Kühn, Richard Mycroft +1
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by Küh…
Triangle packings and 1-factors in oriented graphs
Peter Keevash, Benny Sudakov
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices wit…
Shadows and intersections: stability and new proofs
Peter Keevash
We give a short new proof of a version of the Kruskal-Katona theorem due to Lovász. Our method can be extended to a stability result, describing the approximate structure of config…
An exact minimum degree condition for Hamilton cycles in oriented graphs
Peter Keevash, Daniela Kühn, Deryk Osthus
We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thoma…