Peter Allen

Affiliations:

London School of Economics, Department of Mathematics, United Kingdom

According to our database¹, Peter Allen authored at least 31 papers between 2008 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

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

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2023

2022

A spanning bandwidth theorem in random graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

2021

An Approximate Blow-up Lemma for Sparse Hypergraphs.

[BibT_eX]

[DOI]

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

2020

Almost all trees are almost graceful.

[BibT_eX]

[DOI]

Random Struct. Algorithms, July, 2020

Regularity inheritance in pseudorandom graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

2018

Finding Tight Hamilton Cycles in Random Hypergraphs Faster.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Chromatic thresholds in sparse random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Tight cycles and regular slices in dense hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2017

Packing degenerate graphs greedily.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.

[BibT_eX]

[DOI]

Comb., 2017

2015

Tight Hamilton cycles in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Ramsey Numbers of Squares of Paths.

[BibT_eX]

[DOI]

Peter Allen

Barnaby Roberts

Jozef Skokan

Electron. Notes Discret. Math., 2015

Triangle-Free Subgraphs of Random Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Regular slices for hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

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

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2014

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

[BibT_eX]

[DOI]

Peter Allen

Julia Böttcher

Yury Person

J. Comb. Theory, Ser. B, 2014

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

[BibT_eX]

[DOI]

Peter Allen

Yoshiharu Kohayakawa

Guilherme Oliveira Mota

Roberto F. Parente

Electron. J. Comb., 2014

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Turánnical hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Maximum Planar Subgraphs in Dense Graphs.

[BibT_eX]

[DOI]

Peter Allen

Jozef Skokan

Andreas Würfl

Electron. J. Comb., 2013

Ramsey-goodness - and otherwise.

[BibT_eX]

[DOI]

Peter Allen

Graham R. Brightwell

Jozef Skokan

Comb., 2013

2011

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

[BibT_eX]

[DOI]

Peter Allen

Julia Böttcher

Jan Hladký

J. Lond. Math. Soc., 2011

A density Corrádi-Hajnal theorem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

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

[BibT_eX]

[DOI]

Peter Allen

Electron. J. Comb., 2010

2009

Minimum degree conditions for large subgraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Clique-Width and the Speed of Hereditary Properties.

[BibT_eX]

[DOI]

Peter Allen

Vadim V. Lozin

Michaël Rao

Electron. J. Comb., 2009

2008

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

[BibT_eX]

[DOI]

Peter Allen

Comb. Probab. Comput., 2008

Peter Allen

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...