Peter Allen

According to our database, Peter Allen authored at least 33 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.

Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein

Eur. J. Comb., 2024

The Ramsey Numbers of Squares of Paths and Cycles.

Domenico Mergoni Cecchelli, Peter Allen, Jozef Skokan, Barnaby Roberts

Electron. J. Comb., 2024

2023

The Ramsey number of a long even cycle versus a star.

Peter Allen, Tomasz Luczak, Joanna Polcyn, Yanbo Zhang

J. Comb. Theory B, 2023

2022

A spanning bandwidth theorem in random graphs.

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz

Comb. Probab. Comput., 2022

2021

An Approximate Blow-up Lemma for Sparse Hypergraphs.

Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Almost all trees are almost graceful.

Anna Adamaszek, Peter Allen, Codrut Grosu, Jan Hladký

Random Struct. Algorithms, July, 2020

Regularity inheritance in pseudorandom graphs.

Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein

Random Struct. Algorithms, 2020

2018

Finding Tight Hamilton Cycles in Random Hypergraphs Faster.

Peter Allen, Christoph Koch, Olaf Parczyk, Yury Person

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Chromatic thresholds in sparse random graphs.

Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris

Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.

Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris

Random Struct. Algorithms, 2017

Tight cycles and regular slices in dense hypergraphs.

Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

J. Comb. Theory A, 2017

Packing degenerate graphs greedily.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.

Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person

Comb., 2017

2015

Tight Hamilton cycles in random hypergraphs.

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person

Random Struct. Algorithms, 2015

Ramsey Numbers of Squares of Paths.

Peter Allen, Barnaby Roberts, Jozef Skokan

Electron. Notes Discret. Math., 2015

Triangle-Free Subgraphs of Random Graphs.

Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa

Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz

Electron. Notes Discret. Math., 2015

Regular slices for hypergraphs.

Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.

Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

Electron. Notes Discret. Math., 2015

2014

Turán numbers of bipartite graphs plus an odd cycle.

Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte

J. Comb. Theory B, 2014

An improved error term for minimum H-decompositions of graphs.

Peter Allen, Julia Böttcher, Yury Person

J. Comb. Theory B, 2014

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.

Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente

Electron. J. Comb., 2014

An Extension of Turán's Theorem, Uniqueness and Stability.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. J. Comb., 2014

2013

Turánnical hypergraphs.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Random Struct. Algorithms, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.

Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person

Electron. Notes Discret. Math., 2013

Maximum Planar Subgraphs in Dense Graphs.

Peter Allen, Jozef Skokan, Andreas Würfl

Electron. J. Comb., 2013

Ramsey-goodness - and otherwise.

Peter Allen, Graham R. Brightwell, Jozef Skokan

Comb., 2013

2011

Filling the gap between Turán's theorem and Pósa's conjecture.

Peter Allen, Julia Böttcher, Jan Hladký

J. Lond. Math. Soc., 2011

A density Corrádi-Hajnal theorem.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2011

2010

Dense H-Free Graphs are Almost (<i>χ(H)-1</i>)-Partite.

Peter Allen

Electron. J. Comb., 2010

2009

Minimum degree conditions for large subgraphs.

Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley

Electron. Notes Discret. Math., 2009

Clique-Width and the Speed of Hereditary Properties.

Peter Allen, Vadim V. Lozin, Michaël Rao

Electron. J. Comb., 2009

2008

Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles.

Peter Allen

Comb. Probab. Comput., 2008