Peter Keevash, Ph.D.

2004 Princeton University, Princeton, NJ 
"Peter Keevash"


Sign in to add mentor
Benjamin Sudakov grad student 2004 Princeton
 (The role of approximate structure in extremal combinatorics.)
BETA: Related publications


You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Keevash P, Long E. (2016) On the Normalized Shannon Capacity of a Union Combinatorics Probability and Computing. 25: 766-767
Keevash P, Mycroft R. (2015) A geometric theory for hypergraph matching Memoirs of the American Mathematical Society. 223: 1-95
Keevash P, Mycroft R. (2015) A multipartite Hajnal-Szemerédi theorem Journal of Combinatorial Theory. Series B. 114: 187-236
Keevash P, Knox F, Mycroft R. (2015) Polynomial-time perfect matchings in dense hypergraphs Advances in Mathematics. 269: 265-334
Keevash P, Lenz J, Mubayi D. (2014) Spectral extremal problems for hypergraphs Siam Journal On Discrete Mathematics. 28: 1838-1854
Allen P, Keevash P, Sudakov B, et al. (2014) Turán numbers of bipartite graphs plus an odd cycle Journal of Combinatorial Theory. Series B. 106: 134-162
Keevash P, Li Z, Mohar B, et al. (2013) Digraph girth via chromatic number Siam Journal On Discrete Mathematics. 27: 693-696
Hefetz D, Keevash P. (2013) A hypergraph Turán theorem via lagrangians of intersecting families Journal of Combinatorial Theory. Series A. 120: 2020-2038
Keevash P, Sudakov B, Verstraëte J. (2013) On a conjecture of Erdo{double acute}s and Simonovits: Even cycles Combinatorica. 33: 699-732
Christofides D, Ellis D, Keevash P. (2013) An approximate isoperimetric inequality for r-sets Electronic Journal of Combinatorics. 20
See more...