| Hypergraph turan problems P Keevash Surveys in combinatorics 392, 83-140, 2011 | 445 | 2011 |
| The existence of designs P Keevash arXiv preprint arXiv:1401.3665, 2014 | 398 | 2014 |
| The early evolution of the H-free process T Bohman, P Keevash Inventiones mathematicae 181 (2), 291-336, 2010 | 212 | 2010 |
| The Turán number of the Fano plane P Keevash, B Sudakov* Combinatorica 25 (5), 561-574, 2005 | 136* | 2005 |
| Rainbow turán problems P Keevash, D Mubayi, B Sudakov, J Verstraëte Combinatorics, Probability and Computing 16 (1), 109-126, 2007 | 117 | 2007 |
| The number of edge colorings with no monochromatic cliques N Alon, J Balogh, P Keevash, B Sudakov Journal of the London Mathematical Society 70 (2), 273-288, 2004 | 104 | 2004 |
| A geometric theory for hypergraph matching P Keevash, R Mycroft American Mathematical Society 233 (1098), 2015 | 101 | 2015 |
| Stability theorems for cancellative hypergraphs P Keevash, D Mubayi Journal of Combinatorial Theory, Series B 92 (1), 163-175, 2004 | 94 | 2004 |
| Loose Hamilton cycles in hypergraphs P Keevash, D Kühn, R Mycroft, D Osthus Discrete Mathematics 311 (7), 544-559, 2011 | 91 | 2011 |
| Dynamic concentration of the triangle-free process T Bohman, P Keevash The Seventh European Conference on Combinatorics, Graph Theory and …, 2013 | 84 | 2013 |
| Shadows and intersections: stability and new proofs P Keevash Advances in Mathematics 218 (5), 1685-1703, 2008 | 84 | 2008 |
| Algorithms for# BIS-hard problems on expander graphs M Jenssen, P Keevash, W Perkins SIAM Journal on Computing 49 (4), 681-710, 2020 | 81 | 2020 |
| An exact minimum degree condition for Hamilton cycles in oriented graphs P Keevash, D Kühn, D Osthus Journal of the London Mathematical Society 79 (1), 144-166, 2009 | 77 | 2009 |
| The existence of designs II P Keevash arXiv preprint arXiv:1802.05900, 2018 | 76 | 2018 |
| Counting designs P Keevash Journal of the European Mathematical Society 20 (4), 903-927, 2018 | 75 | 2018 |
| Spectral extremal problems for hypergraphs P Keevash, J Lenz, D Mubayi SIAM Journal on Discrete Mathematics 28 (4), 1838-1854, 2014 | 69 | 2014 |
| Set systems without a simplex or a cluster P Keevash, D Mubayi Combinatorica 30, 175-200, 2010 | 69 | 2010 |
| On a hypergraph Turán problem of Frankl P Keevash, B Sudakov* Combinatorica 25 (6), 673-706, 2005 | 69 | 2005 |
| Equiangular lines and spherical codes in Euclidean space I Balla, F Dräxler, P Keevash, B Sudakov Inventiones mathematicae 211 (1), 179-212, 2018 | 68 | 2018 |
| Dynamic concentration of the triangle‐free process T Bohman, P Keevash Random Structures & Algorithms 58 (2), 221-293, 2021 | 53 | 2021 |
