Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles. - Peter Allen 001 (Comb. Probab. Comput., 2008)

Clique-Width and the Speed of Hereditary Properties. - Peter Allen 001; Vadim V. Lozin; Michaël Rao (Electron. J. Comb., 2009)

Minimum degree conditions for large subgraphs. - Peter Allen 001; Julia Böttcher; Jan Hladký; Oliver Cooley (Electron. Notes Discret. Math., 2009)

Forbidden induced bipartite graphs. - Peter Allen 001 (J. Graph Theory, 2009)

Dense H-Free Graphs are Almost (χ(H)-1)-Partite. - Peter Allen 001 (Electron. J. Comb., 2010)

A density Corrádi-Hajnal theorem. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2011)

Filling the gap between Turán's theorem and Pósa's conjecture. - Peter Allen 001; Julia Böttcher; Jan Hladký (J. Lond. Math. Soc., 2011)

Ramsey-goodness - and otherwise. - Peter Allen 001; Graham R. Brightwell; Jozef Skokan (Comb., 2013)

Maximum Planar Subgraphs in Dense Graphs. - Peter Allen 001; Jozef Skokan; Andreas Würfl (Electron. J. Comb., 2013)

An approximate blow-up lemma for sparse pseudorandom graphs. - Peter Allen 001; Julia Böttcher; Hiêp Hàn; Yoshiharu Kohayakawa; Yury Person (Electron. Notes Discret. Math., 2013)

Turánnical hypergraphs. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Random Struct. Algorithms, 2013)

An Extension of Turán's Theorem, Uniqueness and Stability. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Electron. J. Comb., 2014)

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. - Peter Allen 001; Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Roberto F. Parente (Electron. J. Comb., 2014)

An improved error term for minimum H-decompositions of graphs. - Peter Allen 001; Julia Böttcher; Yury Person (J. Comb. Theory B, 2014)

Turán numbers of bipartite graphs plus an odd cycle. - Peter Allen 001; Peter Keevash; Benny Sudakov; Jacques Verstraëte (J. Comb. Theory B, 2014)

Tight Cycles in Hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (Electron. Notes Discret. Math., 2015)

Regular slices for hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (Electron. Notes Discret. Math., 2015)

Local resilience of spanning subgraphs in sparse random graphs. - Peter Allen 001; Julia Böttcher; Julia Ehrenmüller; Anusch Taraz (Electron. Notes Discret. Math., 2015)

Triangle-Free Subgraphs of Random Graphs. - Peter Allen 001; Julia Böttcher; Barnaby Roberts; Yoshiharu Kohayakawa (Electron. Notes Discret. Math., 2015)

Ramsey Numbers of Squares of Paths. - Peter Allen 001; Barnaby Roberts; Jozef Skokan (Electron. Notes Discret. Math., 2015)

Tight Hamilton cycles in random hypergraphs. - Peter Allen 001; Julia Böttcher; Yoshiharu Kohayakawa; Yury Person (Random Struct. Algorithms, 2015)

Powers of Hamilton cycles in pseudorandom graphs. - Peter Allen 001; Julia Böttcher; Hiêp Hàn; Yoshiharu Kohayakawa; Yury Person (Comb., 2017)

Packing degenerate graphs greedily. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2017)

Tight cycles and regular slices in dense hypergraphs. - Peter Allen 001; Julia Böttcher; Oliver Cooley; Richard Mycroft (J. Comb. Theory A, 2017)

Chromatic thresholds in dense random graphs. - Peter Allen 001; Julia Böttcher; Simon Griffiths; Yoshiharu Kohayakawa; Robert Morris 001 (Random Struct. Algorithms, 2017)

Chromatic thresholds in sparse random graphs. - Peter Allen 001; Julia Böttcher; Simon Griffiths; Yoshiharu Kohayakawa; Robert Morris 001 (Random Struct. Algorithms, 2017)

Finding Tight Hamilton Cycles in Random Hypergraphs Faster. - Peter Allen 001; Christoph Koch 008; Olaf Parczyk; Yury Person (LATIN, 2018)

Regularity inheritance in pseudorandom graphs. - Peter Allen 001; Julia Böttcher; Jozef Skokan; Maya Stein (Random Struct. Algorithms, 2020)

Almost all trees are almost graceful. - Anna Adamaszek; Peter Allen 001; Codrut Grosu; Jan Hladký (Random Struct. Algorithms, 2020)

An Approximate Blow-up Lemma for Sparse Hypergraphs. - Peter Allen 001; Julia Böttcher; Eng Keat Hng; Jozef Skokan; Ewan Davies (LAGOS, 2021)

A spanning bandwidth theorem in random graphs. - Peter Allen 001; Julia Böttcher; Julia Ehrenmüller; Jakob Schnitzer; Anusch Taraz (Comb. Probab. Comput., 2022)

The Ramsey number of a long even cycle versus a star. - Peter Allen 001; Tomasz Luczak 001; Joanna Polcyn; Yanbo Zhang (J. Comb. Theory B, 2023)

The Ramsey Numbers of Squares of Paths and Cycles. - Domenico Mergoni Cecchelli; Peter Allen 001; Jozef Skokan; Barnaby Roberts (Electron. J. Comb., 2024)

Resilience for tight Hamiltonicity. - Peter Allen 001; Olaf Parczyk; Vincent Pfenninger (Comb. Theory, 2024)

Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. - Peter Allen 001; Julia Böttcher; Richard Lang; Jozef Skokan; Maya Stein (Eur. J. Comb., 2024)

A robust Corrádi-Hajnal theorem. - Peter Allen 001; Julia Böttcher; Jan Corsten; Ewan Davies; Matthew Jenssen; Patrick Morris 001; Barnaby Roberts; Jozef Skokan (Random Struct. Algorithms, 2024)