Items where Author is "Allen, Peter"

Item Type No Grouping

Blow-up lemmas for sparse graphs. (2024) Allen, Peter; Böttcher, Julia; Hàn, Hiệp; Kohayakawa, Yoshiharu; Person, Yury picture_as_pdf

Perfectly packing graphs with bounded degeneracy and many leaves. (2022) Allen, Peter; Böttcher, Julia; Clemens, Dennis; Taraz, Anusch picture_as_pdf

Almost all trees are almost graceful. Adamaszek, Anna; Allen, Peter; Grosu, Codrut; Hladky, Jan picture_as_pdf

Almost every 2-SAT function is unate. Allen, Peter

Book review: The good politician:folk theories, political interaction and the rise of anti-politics by Nick Clarke et al. Allen, Peter picture_as_pdf

Book review: the good politician: folk theories, political interaction and the rise of anti-politics by Nick Clarke et al. Allen, Peter picture_as_pdf

Career politicians are elected young, promoted quickly and dominate the highest offices of state. Allen, Peter

Choosing uncertainty: why rational decision-making doesn't always work in politics. Allen, Peter

Chromatic thresholds in dense random graphs. Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu; Morris, Robert

Chromatic thresholds in sparse random graphs. Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu; Morris, Robert

Clique-width and the speed of hereditary properties. Allen, Peter; Lozin, Vadim; Rao, Michaël

Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. Allen, Peter

Dense H-free graphs are almost (χ(H)−1)-partite. Allen, Peter

Do women and men support women’s representation equally? Allen, Peter; Cutts, David

Filling the gap between Turan's theorem and Posa's conjecture. Allen, Peter; Böttcher, Julia; Hladky, Jan

Finding tight Hamilton cycles in random hypergraphs faster. Allen, Peter; Koch, Christoph; Parczyk, Olaf; Person, Yury picture_as_pdf

Finding tight hamilton cycles in random hypergraphs faster. Allen, Peter; Koch, Christoph; Parczyk, Olaf; Person, Yury picture_as_pdf

Forbidden induced bipartite graphs. Allen, Peter

How women work together in masculinised parliaments to represent the interests of women. Allen, Peter; Childs, Sarah picture_as_pdf

Local resilience of spanning subgraphs in sparse random graphs. Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Taraz, Anusch

Maximum planar subgraphs in dense graphs. Allen, Peter; Skokan, Jozef; Würfl, Andreas

Minimum degree conditions for large subgraphs. Allen, Peter; Böttcher, Julia; Hladký, Jan; Cooley, Oliver

Packing degenerate graphs. Allen, Peter; Böttcher, Julia; Hladký, Jan; Piguet, Diana picture_as_pdf

Packing degenerate graphs greedily. Allen, Peter; Böttcher, Julia; Hladký, Jan; Piguet, Diana

Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles. Allen, Peter; Böttcher, Julia; Lang, Richard; Skokan, Jozef; Stein, Maya picture_as_pdf

Powers of Hamilton cycles in pseudorandom graphs. Allen, Peter; Böttcher, Julia; Hàn, Hiệp; Kohayakawa, Yoshiharu; Person, Yury

Powers of hamilton cycles in pseudorandom graphs. Allen, Peter; Böttcher, Julia; Hàn, Hiệp; Kohayakawa, Yoshiharu; Person, Yury

The Ramsey number of a long even cycle versus a star. Allen, Peter; Luczak, Tomasz; Polcyn, Joanna; Zhang, Yanbo picture_as_pdf

Ramsey numbers of squares of paths. Allen, Peter; Roberts, Barnaby; Skokan, Jozef

The Ramsey numbers of squares of paths and cycles. Allen, Peter; Mergoni Cecchelli, Domenico; Skokan, Jozef; Roberts, Barnaby picture_as_pdf

Ramsey-goodness - and otherwise. Allen, Peter; Brightwell, Graham; Skokan, Jozef

Ramsey-goodness - and otherwise. Allen, Peter; Brightwell, Graham; Skokan, Jozef

Regular slices for hypergraphs. Allen, Peter; Böttcher, Julia; Cooley, Oliver; Mycroft, Richard

Regularity inheritance in pseudorandom graphs. Allen, Peter; Böttcher, Julia; Skokan, Jozef; Stein, Maya picture_as_pdf

Report of the large-scale Structures in random graphs workshop. Allen, Peter; Böttcher, Julia; Skokan, Jozef

Resilience for tight Hamiltonicity. Allen, Peter; Parczyk, Olaf; Pfenninger, Vincent picture_as_pdf

Tight Hamilton cycles in random hypergraphs. Allen, Peter; Böttcher, Julia; Kohayakawa, Yoshiharu; Person, Yury

Tight cycles and regular slices in dense hypergraphs. Allen, Peter; Böttcher, Julia; Cooley, Oliver; Mycroft, Richard

Tight cycles in hypergraphs. Allen, Peter; Böttcher, Julia; Cooley, Oliver; Mycroft, Richard

Triangle-free subgraphs of random graphs. Allen, Peter; Böttcher, Julia; Roberts, Barnaby; Kohayakawa, Yoshiharu

Triangle-free subgraphs of random graphs. Allen, Peter; Böttcher, Julia; Kohayakawa, Yoshiharu; Roberts, Barnaby

Turán numbers of bipartite graphs plus an odd cycle. Allen, Peter; Keevash, Peter; Sudakov, Benny; Verstraëte, Jacques

An approximate blow-up lemma for sparse hypergraphs. Allen, Peter; Böttcher, Julia; Hng, Eng Keat; Skokan, Jozef; Davies, Ewan picture_as_pdf

An approximate blow-up lemma for sparse pseudorandom graphs. Allen, Peter; Böttcher, Julia; Hàn, Hiệp; Kohayakawa, Yoshiharu; Person, Yury

The bandwidth theorem in sparse graphs. Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Taraz, Anusch picture_as_pdf

The chromatic threshold of graphs. Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu

A density Corrádi-Hajnal theorem. Allen, Peter; Böttcher, Julia; Hladký, Jan; Piguet, Diana

An extension of Turán's theorem, uniqueness and stability. Allen, Peter; Böttcher, Julia; Hladký, Jan; Piguet, Diana

An improved error term for minimum H-decompositions of graphs. Allen, Peter; Böttcher, Julia; Person, Yury

The professionalisation of politics makes our democracy less representative and less accessible. Allen, Peter

A robust Corrádi–Hajnal theorem. Allen, Peter; Böttcher, Julia; Corsten, Jan; Davies, Ewan; Jenssen, Matthew; Morris, Patrick; Roberts, Barnaby; Skokan, Jozef picture_as_pdf

A spanning bandwidth theorem in random graphs. Allen, Peter; Böttcher, Julia; Ehrenmüller, Julia; Schnitzer, Jakob; Taraz, Anusch picture_as_pdf