LSE creators

Number of items: 53.
LSE
  • Allen, Peter, Childs, Sarah (1 October 2018) How women work together in masculinised parliaments to represent the interests of women. British Politics and Policy at LSE. picture_as_pdf
  • Allen, Peter (2018). Book review: the good politician: folk theories, political interaction and the rise of anti-politics by Nick Clarke et al. picture_as_pdf
  • Allen, Peter (2017). Choosing uncertainty: why rational decision-making doesn't always work in politics.
  • Allen, Peter, Böttcher, Julia, Skokan, Jozef (2017). Report of the large-scale Structures in random graphs workshop.
  • Allen, Peter, Cutts, David (2017). Do women and men support women’s representation equally?
  • Allen, Peter (2013). The professionalisation of politics makes our democracy less representative and less accessible.
  • Allen, Peter (2012). Career politicians are elected young, promoted quickly and dominate the highest offices of state.
    • Mathematics
  • Allen, Peter, Böttcher, Julia, Katz, Jasmin (2025). Universality for degenerate hypergraphs. Procedia Computer Science, 273, 381-388. https://doi.org/10.1016/j.procs.2025.10.322 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2025). Blow-up lemmas for sparse graphs. Discrete Analysis, 2025(8). https://doi.org/10.19086/da.143410 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Lang, Richard, Skokan, Jozef, Stein, Maya (2024). Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles. European Journal of Combinatorics, 121, https://doi.org/10.1016/j.ejc.2023.103838 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby, Skokan, Jozef (2024). A robust Corrádi–Hajnal theorem. Random Structures and Algorithms, 65(1), 61-130. https://doi.org/10.1002/rsa.21209 picture_as_pdf
  • Allen, Peter, Parczyk, Olaf, Pfenninger, Vincent (2024). Resilience for tight Hamiltonicity. Combinatorial Theory, 4(1). https://doi.org/10.5070/C64163846 picture_as_pdf
  • Allen, Peter, Mergoni Cecchelli, Domenico, Skokan, Jozef, Roberts, Barnaby (2024). The Ramsey numbers of squares of paths and cycles. Electronic Journal of Combinatorics, 31(2). https://doi.org/10.37236/11847 picture_as_pdf
  • Allen, Peter, Luczak, Tomasz, Polcyn, Joanna, Zhang, Yanbo (2023). The Ramsey number of a long even cycle versus a star. Journal of Combinatorial Theory, Series B, 162, 144 - 153. https://doi.org/10.1016/j.jctb.2023.05.001 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Clemens, Dennis, Taraz, Anusch (2022). Perfectly packing graphs with bounded degeneracy and many leaves. Israel Journal of Mathematics, https://doi.org/10.1007/s11856-022-2447-7 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Ehrenmüller, Julia, Schnitzer, Jakob, Taraz, Anusch (2022). A spanning bandwidth theorem in random graphs. Combinatorics Probability and Computing, 31(4), 598 - 628. https://doi.org/10.1017/S0963548321000481 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hng, Eng Keat, Skokan, Jozef, Davies, Ewan (2022). An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195, 394 - 403. https://doi.org/10.1016/j.procs.2021.11.048 picture_as_pdf
  • Allen, Peter, Koch, Christoph, Parczyk, Olaf, Person, Yury (2020). Finding tight Hamilton cycles in random hypergraphs faster. Combinatorics, Probability and Computing, https://doi.org/10.1017/S0963548320000450 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Ehrenmüller, Julia, Taraz, Anusch (2020). The bandwidth theorem in sparse graphs. Advances in Combinatorics, 2020(1), 1 - 60. https://doi.org/10.19086/aic.12849 picture_as_pdf
  • Adamaszek, Anna, Allen, Peter, Grosu, Codrut, Hladky, Jan (2020). Almost all trees are almost graceful. Random Structures and Algorithms, 56(4), 948-987. https://doi.org/10.1002/rsa.20906 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Skokan, Jozef, Stein, Maya (2020). Regularity inheritance in pseudorandom graphs. Random Structures and Algorithms, 56(2), 306 - 338. https://doi.org/10.1002/rsa.20851 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2019). Packing degenerate graphs. Advances in Mathematics, 354, https://doi.org/10.1016/j.aim.2019.106739 picture_as_pdf
  • Allen, Peter, Koch, Christoph, Parczyk, Olaf, Person, Yury (2018). Finding tight hamilton cycles in random hypergraphs faster. In Bender, M., Farach-Colton, M., Mosteiro, M. (Eds.), LATIN 2018: theoretical informatics (pp. 28-36). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-319-77404-6_3 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu, Morris, Robert (2017). Chromatic thresholds in sparse random graphs. Random Structures and Algorithms, 51(2), 215-236. https://doi.org/10.1002/rsa.20709
  • Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu, Roberts, Barnaby (2017). Triangle-free subgraphs of random graphs. Combinatorics, Probability and Computing, 27(2), 141-161. https://doi.org/10.1017/S0963548317000219
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2017). Packing degenerate graphs greedily. Electronic Notes in Discrete Mathematics, 61, 45-51. https://doi.org/10.1016/j.endm.2017.06.019
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2017). Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, 37(4), 573-616. https://doi.org/10.1007/s00493-015-3228-2
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu, Morris, Robert (2017). Chromatic thresholds in dense random graphs. Random Structures and Algorithms, 51(2), 185 - 214. https://doi.org/10.1002/rsa.20708
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2017). Tight cycles and regular slices in dense hypergraphs. Journal of Combinatorial Theory, Series A, 149, 30-100. https://doi.org/10.1016/j.jcta.2017.01.003
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2015). Regular slices for hypergraphs. Electronic Notes in Discrete Mathematics, 49, 691-698. https://doi.org/10.1016/j.endm.2015.06.093
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2015). A density Corrádi-Hajnal theorem. Canadian Journal of Mathematics, 67(4), 721-758. https://doi.org/10.4153/CJM-2014-030-6
  • Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu, Person, Yury (2015). Tight Hamilton cycles in random hypergraphs. Random Structures and Algorithms, 46(3), 446-465. https://doi.org/10.1002/rsa.20519
  • Allen, Peter, Böttcher, Julia, Ehrenmüller, Julia, Taraz, Anusch (2015-08-31 - 2015-09-04) Local resilience of spanning subgraphs in sparse random graphs [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Roberts, Barnaby, Skokan, Jozef (2015-08-31 - 2015-09-04) Ramsey numbers of squares of paths [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2015-08-31 - 2015-09-04) Tight cycles in hypergraphs [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Böttcher, Julia, Roberts, Barnaby, Kohayakawa, Yoshiharu (2015-08-31 - 2015-09-04) Triangle-free subgraphs of random graphs [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Böttcher, Julia, Person, Yury (2014). An improved error term for minimum H-decompositions of graphs. Journal of Combinatorial Theory, Series B, 108, 92-101. https://doi.org/10.1016/j.jctb.2014.03.001
  • Allen, Peter, Keevash, Peter, Sudakov, Benny, Verstraëte, Jacques (2014). Turán numbers of bipartite graphs plus an odd cycle. Journal of Combinatorial Theory, Series B, 106, 134-162. https://doi.org/10.1016/j.jctb.2014.01.007
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2014). Powers of hamilton cycles in pseudorandom graphs. LATIN 2014: Theoretical Informatics, 8392(30), 355-366. https://doi.org/10.1007/978-3-642-54423-1_31
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2014). An extension of Turán's theorem, uniqueness and stability. Electronic Journal of Combinatorics, 21(4), P4.5.
  • Allen, Peter, Brightwell, Graham, Skokan, Jozef (2013). Ramsey-goodness - and otherwise. Combinatorica, 33(2), 125-160. https://doi.org/10.1007/s00493-013-2778-4
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu (2013). The chromatic threshold of graphs. Advances in Mathematics, 235, 261-295. https://doi.org/10.1016/j.aim.2012.11.016
  • Allen, Peter, Skokan, Jozef, Würfl, Andreas (2013). Maximum planar subgraphs in dense graphs. Electronic Journal of Combinatorics, 20(3). https://doi.org/P1
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2013). An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics, 44, 393-398. https://doi.org/10.1016/j.endm.2013.10.061
  • Allen, Peter, Böttcher, Julia, Hladky, Jan (2011). Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, 84(2), 269-302. https://doi.org/10.1112/jlms/jdr007
  • Allen, Peter, Brightwell, Graham, Skokan, Jozef (2010). Ramsey-goodness - and otherwise. arXiv.org.
  • Allen, Peter (2010). Dense H-free graphs are almost (χ(H)−1)-partite. Electronic Journal of Combinatorics, 27(R21).
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Cooley, Oliver (2009). Minimum degree conditions for large subgraphs. Electronic Notes in Discrete Mathematics, 34, 75-79. https://doi.org/10.1016/j.endm.2009.07.013
  • Allen, Peter, Lozin, Vadim, Rao, Michaël (2009). Clique-width and the speed of hereditary properties. Electronic Journal of Combinatorics, 16(1), R35.
  • Allen, Peter (2009). Forbidden induced bipartite graphs. Journal of Graph Theory, 60(3), 219-241. https://doi.org/10.1002/jgt.20355
  • Allen, Peter (2008). Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. Combinatorics, Probability and Computing, 17(4), 471-486. https://doi.org/10.1017/S0963548308009164
  • Allen, Peter (2008). Finding combinatorial structures [Doctoral thesis]. London School of Economics and Political Science. description
  • Allen, Peter (2007). Almost every 2-SAT function is unate. Israel Journal of Mathematics, 161(1), 311-346. https://doi.org/10.1007/s11856-007-0081-z