Allen, Peter


Dr Peter Allen  

Department

Position held

Department of Mathematics

Lecturer in Mathematics

Experience keywords:

Ramsey theory; asymptotic enumeration; extremal combinatorics; random and quasirandom graphs and hypergraphs

Research summary > [Click to expand]

Dr Allen specialises in: extremal and random combinatorics; in particular Ramsey theory, extremal (hyper)graph theory, extremal theorems on (quasi)random structures, and algorithmic aspects thereof.

Languages:

German [Spoken: Fluent, Written: Fluent]

Contact Points

LSE phone number:

+44 (0)20 7955 6289

Publications

LSE Research Online, Funnelback Search

2014

Allen, Peter and Böttcher, Julia and Person, Yury (2014) An improved error term for minimum H-decompositions of graphs Journal of Combinatorial Theory, Series B, Online. ISSN 0095-8956

Allen, Peter and Böttcher, Julia and Hàn, Hiệp and Kohayakawa, Yoshiharu and Person, Yury (2014) Powers of hamilton cycles in pseudorandom graphs LATIN 2014: Theoretical Informatics, 8392 (30). 355-366. ISSN 16113349

Allen, Peter and Keevash, Peter and Sudakov, Benny and Verstraëte, Jacques (2014) Turán numbers of bipartite graphs plus an odd cycle Journal of Combinatorial Theory, Series B, 106 (1). 134-162. ISSN 0095-8956

2013

Allen, Peter and Skokan, Jozef and Würfl, Andreas (2013) Maximum planar subgraphs in dense graphs Electronic Journal of Combinatorics, 20 (3). ISSN 1077-8926

Allen, Peter and Böttcher, Julia and Hàn, Hiệp and Kohayakawa, Yoshiharu and Person, Yury (2013) An approximate blow-up lemma for sparse pseudorandom graphs Electronic Notes in Discrete Mathematics, 44. 393-398. ISSN 1571-0653

Allen, Peter and Böttcher, Julia and Kohayakawa, Yoshiharu and Person, Yury (2013) Tight Hamilton cycles in random hypergraphs Random Structures and Algorithms, online. n/a-n/a. ISSN 1042-9832

Allen, Peter and Böttcher, Julia and Griffiths, Simon and Kohayakawa, Yoshiharu (2013) The chromatic threshold of graphs Advances in Mathematics, 235. 261-295. ISSN 0001-8708

2011

Allen, Peter and Böttcher, Julia and Hladky, Jan (2011) Filling the gap between Turan's theorem and Posa's conjecture Journal of the London Mathematical Society, 84 (2). 269-302. ISSN 0024-6107

2010

Allen, Peter (2010) Dense H-free graphs are almost (χ(H)−1)-partite The Electronic Journal of Combinatorics, 27 (R21). ISSN 1077-8926

2009

Allen, Peter (2009) Forbidden induced bipartite graphs Journal of Graph Theory, 60 (3). 219-241. ISSN 0364-9024

Allen, Peter and Lozin, Vadim and Rao, Michaël (2009) Clique-width and the speed of hereditary properties The Electronic Journal of Combinatorics, 16 (1). R35. ISSN 1077-8926

Allen, Peter and Böttcher, Julia and Hladký, Jan and Cooley, Oliver (2009) Minimum degree conditions for large subgraphs Electronic Notes in Discrete Mathematics, 34. 75-79. ISSN 1571-0653

2008

Allen, Peter (2008) Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles Combinatorics, Probability and Computing, 17 (4). 471-486. ISSN 0963-5483

2007

Allen, Peter (2007) Almost every 2-SAT function is unate Israel Journal of Mathematics, 161 (1). 311-346. ISSN 0021-2172


Expert Image

Personal website

 

Browse the Experts Directory:

LSE Research Online|

Collection of LSE research outputs

LSE Consulting|

Service providing unique access
to LSE's expertise

Create or update your
online profile
|

[access restricted to staff]

Research highlights|

Short articles about LSE research