Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Allen, Peter"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 43.

Article

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Clemens, Dennis and Taraz, Anusch (2021) Perfectly packing graphs with bounded degeneracy and many leaves. Israel Journal of Mathematics. ISSN 0021-2172 (In Press)

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia and Taraz, Anusch (2020) The bandwidth theorem in sparse graphs. Advances in Combinatorics, 2020 (1). 1 - 60. ISSN 2517-5599

Adamaszek, Anna, Allen, Peter ORCID: 0000-0001-6555-3501, Grosu, Codrut and Hladky, Jan (2020) Almost all trees are almost graceful. Random Structures & Algorithms, 56 (4). pp. 948-987. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Stein, Maya (2020) Regularity inheritance in pseudorandom graphs. Random Structures & Algorithms, 56 (2). 306 - 338. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Koch, Christoph, Parczyk, Olaf and Person, Yury (2020) Finding tight Hamilton cycles in random hypergraphs faster. Combinatorics, Probability and Computing. ISSN 0963-5483

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2019) Packing degenerate graphs. Advances in Mathematics, 354. ISSN 0001-8708

Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu and Morris, Robert (2017) Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, 51 (2). pp. 215-236. ISSN 1042-9832

Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu and Roberts, Barnaby (2017) Triangle-free subgraphs of random graphs. Combinatorics, Probability and Computing, 27 (2). pp. 141-161. ISSN 0963-5483

Allen, Peter, Böttcher, Julia, Hladký, Jan and Piguet, Diana (2017) Packing degenerate graphs greedily. Electronic Notes in Discrete Mathematics, 61. pp. 45-51. ISSN 1571-0653

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hàn, Hiệp, Kohayakawa, Yoshiharu and Person, Yury (2017) Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, 37 (4). pp. 573-616. ISSN 0209-9683

Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu and Morris, Robert (2017) Chromatic thresholds in dense random graphs. Random Structures & Algorithms, 51 (2). 185 - 214. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2017) Tight cycles and regular slices in dense hypergraphs. Journal of Combinatorial Theory, Series A, 149. pp. 30-100. ISSN 0097-3165

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2015) Regular slices for hypergraphs. Electronic Notes in Discrete Mathematics, 49. pp. 691-698. ISSN 1571-0653

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana (2015) A density Corrádi-Hajnal theorem. Canadian Journal of Mathematics, 67 (4). pp. 721-758. ISSN 0008-414X

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Person, Yury (2015) Tight Hamilton cycles in random hypergraphs. Random Structures & Algorithms, 46 (3). pp. 446-465. ISSN 1042-9832

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635 and Person, Yury (2014) An improved error term for minimum H-decompositions of graphs. Journal of Combinatorial Theory, Series B, 108. pp. 92-101. ISSN 0095-8956

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

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Hàn, Hiệp, Kohayakawa, Yoshiharu and Person, Yury (2014) Powers of hamilton cycles in pseudorandom graphs. LATIN 2014: Theoretical Informatics, 8392 (30). pp. 355-366. ISSN 1611-3349

Allen, Peter, Böttcher, Julia, Hladký, Jan and Piguet, Diana (2014) An extension of Turán's theorem, uniqueness and stability. Electronic Journal of Combinatorics, 21 (4). P4.5. ISSN 1077-8926

Allen, Peter ORCID: 0000-0001-6555-3501, Brightwell, Graham and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2013) Ramsey-goodness - and otherwise. Combinatorica, 33 (2). pp. 125-160. ISSN 0209-9683

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Griffiths, Simon and Kohayakawa, Yoshiharu (2013) The chromatic threshold of graphs. Advances in Mathematics, 235. pp. 261-295. ISSN 0001-8708

Allen, Peter ORCID: 0000-0001-6555-3501, Skokan, Jozef ORCID: 0000-0003-3996-7676 and Würfl, Andreas (2013) Maximum planar subgraphs in dense graphs. Electronic Journal of Combinatorics, 20 (3). ISSN 1077-8926

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

Allen, Peter, 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). pp. 269-302. ISSN 0024-6107

Allen, Peter ORCID: 0000-0001-6555-3501 (2010) Dense H-free graphs are almost (χ(H)−1)-partite. Electronic Journal of Combinatorics, 27 (R21). ISSN 1077-8926

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

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

Allen, Peter ORCID: 0000-0001-6555-3501 (2009) Forbidden induced bipartite graphs. Journal of Graph Theory, 60 (3). pp. 219-241. ISSN 0364-9024

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

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

Book Section

Allen, Peter, Koch, Christoph, Parczyk, Olaf and Person, Yury (2018) Finding tight hamilton cycles in random hypergraphs faster. In: Bender, M., Farach-Colton, M. and Mosteiro, M., (eds.) LATIN 2018: theoretical informatics. Lecture Notes in Computer Science (10807). Springer, Cham, Switzerland, pp. 28-36. ISBN 9783319774039

Monograph

Allen, Peter ORCID: 0000-0001-6555-3501, Brightwell, Graham and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2010) Ramsey-goodness -- and otherwise. . arXiv.org.

Conference or Workshop Item

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia and Taraz, Anusch (2015) Local resilience of spanning subgraphs in sparse random graphs. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway. (Submitted)

Allen, Peter ORCID: 0000-0001-6555-3501, Roberts, Barnaby and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2015) Ramsey numbers of squares of paths. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway.

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Cooley, Oliver and Mycroft, Richard (2015) Tight cycles in hypergraphs. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway. (Submitted)

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Roberts, Barnaby and Kohayakawa, Yoshiharu (2015) Triangle-free subgraphs of random graphs. In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04. (Submitted)

Online resource

Allen, Peter and Childs, Sarah (2018) How women work together in masculinised parliaments to represent the interests of women. British Politics and Policy at LSE (01 Oct 2018). Blog Entry.

Allen, Peter ORCID: 0000-0001-6555-3501 (2018) Book review: the good politician: folk theories, political interaction and the rise of anti-politics by Nick Clarke et al. LSE Review of Books (23 Jul 2018). Website.

Allen, Peter ORCID: 0000-0001-6555-3501 (2017) Choosing uncertainty: why rational decision-making doesn't always work in politics. British Politics and Policy at LSE (27 Oct 2017). Website.

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635 and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2017) Report of the large-scale Structures in random graphs workshop. Maths@LSE Blog (08 Feb 2017). Website.

Allen, Peter ORCID: 0000-0001-6555-3501 and Cutts, David (2017) Do women and men support women’s representation equally? British Politics and Policy at LSE (04 Jan 2017). Website.

Allen, Peter ORCID: 0000-0001-6555-3501 (2013) The professionalisation of politics makes our democracy less representative and less accessible. Democratic Audit Blog (11 Sep 2013). Website.

Allen, Peter ORCID: 0000-0001-6555-3501 (2012) Career politicians are elected young, promoted quickly and dominate the highest offices of state. British Politics and Policy at LSE (19 Jun 2012). Website.

This list was generated on Mon Dec 6 10:24:09 2021 GMT.