- P. Keevash, A hypergraph blowup lemma, submitted. (Revised April 2008.)
- P. Keevash, D. Kühn and D. Osthus,
An exact minimum degree condition for Hamilton cycles in oriented graphs, submitted.
- P. Keevash,
A hypergraph regularity method for generalised Turan problems, submitted.
- P. Keevash and D. Mubayi,
Set systems without a simplex or a cluster, submitted.
- P. Keevash,
Shadows and intersections: stability and new proofs, Adv. Math., to appear.
- P. Keevash and Y. Zhao,
Codegree problems for projective geometries, J. Combin. Theory Ser. B 97 (2007), 919--928.
- P. Keevash, D. Mubayi and R. M. Wilson,
Set systems with no singleton intersection, SIAM J. Disc. Math. 20 (2007), 1031--1041.
- P. Keevash, D. Mubayi, B. Sudakov and J. Verstraete, Rainbow Turan Problems, Combin. Probab. Comput. 16 (2007), 109--126. An unabridged version is available here.
- J. Balogh, P. Keevash and B. Sudakov, On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs, J. Combin. Theory Ser. B 96 (2006), 919--932.
- R. P. Anstee and P. Keevash, Pairwise intersections and forbidden configurations, European J. Combin. 27 (2006), Special Issue on Extremal and Probabilistic Combinatorics, 1235--1248.
- P. Keevash and C. Y. Ku,
A random construction for permutation codes and the covering radius, Designs, Codes and Cryptography 41 (2006), 79--86.
- P. Keevash and B. Sudakov,
On a restricted cross-intersection problem, J. Combin.Theory Ser. A 113 (2006), 1536--1542.
- P. Keevash, P. Loh and B. Sudakov, Bounding the number of edges in permutation graphs, Electron. J. Combin. 13 (2006), R44.
- P. Keevash and B. Sudakov,
Sparse halves in triangle-free graphs, J. Combin. Theory Ser. B 96 (2006), 614--620.
- P. Keevash and B. Sudakov, On a hypergraph Turan problem of Frankl, Combinatorica 25 (2005), 673--706.
- P. Keevash and B. Sudakov, The Turan number of the Fano plane, Combinatorica 25 (2005), 561--574.
- P. Keevash,
The Turan problem for projective geometries, J. Combin. Theory Ser. A, 111 (2005), 289--309. Here is a minor correction.
- J. Balogh, P. Keevash and B. Sudakov, Disjoint representability of sets and their complements, J. Combin. Theory Ser. B, 95 (2005), 12--28.
- P. Keevash, The Turan problem for hypergraphs of fixed size, Electron. J. Combin. 12 (2005), N11.
- P. Keevash and B. Sudakov, Set systems with restricted cross-intersections and the minimum rank of inclusion matrices, SIAM J. Discrete Math. 18 (2005), 713--727.
- N. Alon, J. Balogh, P. Keevash and B. Sudakov, The number of edge colorings with no monochromatic cliques, J. London Math. Soc. 70 (2004), 273--288.
- P. Keevash and D. Mubayi, Stability theorems for cancellative hypergraphs, J. Combin. Theory Ser. B 92 (2004), 163--175.
- B. Bollobas, P. Keevash and B. Sudakov,
Multicoloured extremal problems, J. Combin. Theory Ser. A 107 (2004), 295--312.
- P. Keevash and B. Sudakov, Packing triangles in a graph and its complement, J. Graph Theory 47 (2004), 203--216. A magma program implementing an algorithm used in this paper can be downloaded here.
- P. Keevash, M. Saks, B. Sudakov and J. Verstraete, Multicolour Turan problems, Adv. in Applied Math. 33 (2004), 238--262.
- P. Keevash and B. Sudakov, On the number of edges not covered by monochromatic copies of a fixed graph, J. Combin. Theory Ser. B 90 (2004), 41--53.
- P. Keevash and B. Sudakov, Local density in graphs with forbidden subgraphs, Combin. Probab. Comput. 12 (2003), 139--153.
- B. M. Hambly, P. Keevash, N. O'Connell and D. Stark, The characteristic polynomial of a random permutation matrix, Stoch. Proc. Appl. 90 (2000), 335--346.