- Pancyclicity of Hamiltonian and highly connected graphs Peter Keevash
- A SEMI-EXACT DEGREE CONDITION FOR HAMILTON CYCLES IN DEMETRES CHRISTOFIDES, PETER KEEVASH, DANIELA KUHN AND DERYK OSTHUS
- LOOSE HAMILTON CYCLES IN HYPERGRAPHS PETER KEEVASH, DANIELA KUHN, RICHARD MYCROFT, AND DERYK OSTHUS
- Hypergraph Turan Problems Peter Keevash
- The early evolution of the H-free process Tom Bohman
- Des Codes Crypt (2006) 41:7986 DOI 10.1007/s10623-006-0017-3
- Journal of Combinatorial Theory, Series A 111 (2005) 289309 www.elsevier.com/locate/jcta
- Erratum to Rainbow Turan Problems, by P. Keevash, D. Mubayi, B. Sudakov and J. Verstraete
- The Turan problem for hypergraphs of fixed size Peter Keevash
- Rainbow Turan Problems Peter Keevash
- AN EXACT MINIMUM DEGREE CONDITION FOR HAMILTON CYCLES IN ORIENTED GRAPHS
- SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 4, pp. 10311041
- The characteristic polynomial of a random permutation matrix
- J. London Math. Soc. (2) 70 (2004) 273288 Ce2004 London Mathematical Society DOI: 10.1112/S0024610704005563
- FINDING HAMILTON CYCLES IN ROBUSTLY EXPANDING DEMETRES CHRISTOFIDES, PETER KEEVASH, DANIELA KUHN AND DERYK OSTHUS
- Journal of Combinatorial Theory, Series A 107 (2004) 295312 Multicoloured extremal problems
- Stochastic Processes and their Applications 90 (2000) 335346 www.elsevier.com/locate/spa
- COMBINATORICA Bolyai Society Springer-Verlag
- Journal of Combinatorial Theory, Series B 99 (2009) 709727 Contents lists available at ScienceDirect
- Packing Triangles in a Graph and Its Complement
- The Turan number of F3,3 Peter Keevash
- A hypergraph blow-up lemma Peter Keevash
- COMBINATORICA Bolyai Society Springer-Verlag
- SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics Vol. 24, No. 3, pp. 709756
- Journal of Combinatorial Theory, Series B 100 (2010) 456467 Contents lists available at ScienceDirect
- Combinatorics, Probability and Computing (2010) 19, 285301. c Cambridge University Press 2009 doi:10.1017/S0963548309990460
- A Hypergraph Regularity Method for Generalized Turn Problems*
- Advances in Mathematics 218 (2008) 16851703 www.elsevier.com/locate/aim
- Journal of Combinatorial Theory, Series B 97 (2007) 919928 www.elsevier.com/locate/jctb
- Combinatorics, Probability and Computing (2007) 16, 109126. c 2006 Cambridge University Press doi:10.1017/S0963548306007760 First published online 4 September 2006 Printed in the United Kingdom
- Journal of Combinatorial Theory, Series B 96 (2006) 919932 www.elsevier.com/locate/jctb
- European Journal of Combinatorics 27 (2006) 12351248 www.elsevier.com/locate/ejc
- Bounding the number of edges in permutation graphs Peter Keevash
- Journal of Combinatorial Theory, Series B 96 (2006) 614620 www.elsevier.com/locate/jctb
- SIAM J. DISCRETE MATH. c 2005 Society for Industrial and Applied Mathematics Vol. 18, No. 4, pp. 713727
- Combinatorics, Probability and Computing (2003) 12, 139153. c 2003 Cambridge University Press DOI: 10.1017/S0963548302005539 Printed in the United Kingdom
- Triangle packings and 1-factors in oriented graphs Peter Keevash
- A hypergraph regularity method for generalised Turan problems Peter Keevash
- Set systems without a simplex or a cluster Peter Keevash
- COMBINATORICA Bolyai Society Springer-Verlag
- Advances in Applied Mathematics 33 (2004) 238262 www.elsevier.com/locate/yaama
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 92 (2004) 163175
- A hypergraph blowup lemma Peter Keevash
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 90 (2004) 4153
- Directed graphs without short cycles Peter Keevash
- Journal of Combinatorial Theory, Series A 113 (2006) 15361542 www.elsevier.com/locate/jcta
- Journal of Combinatorial Theory, Series B 95 (2005) 1228 www.elsevier.com/locate/jctb
- A GEOMETRIC THEORY FOR HYPERGRAPH MATCHING PETER KEEVASH AND RICHARD MYCROFT
- On a conjecture of Erdos and Simonovits: Even cycles. Peter Keevash
- Discrete Mathematics 311 (2011) 544559 Contents lists available at ScienceDirect
- Discrete Comput Geom (2011) 46: 7285 DOI 10.1007/s00454-011-9326-z
- Discrete Comput Geom (2011) 46: 4871 DOI 10.1007/s00454-011-9325-0
- A Hypergraph Blow-Up Lemma* Peter Keevash
