Peter Allen

activity

20102026

most citedMaking spanning graphs

3 citations · 7 across the 13 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

A spanning bandwidth theorem in random graphs

Peter Allen, Julia Böttcher, Julia Ehrenmüller +2

The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any $n$ -vertex graph $G$ with minimum degree $(\frac{k - 1}{k} + o (1)) n$ contains all $n$ -vertex $k$ -co…

math.CO2019★ 1 cited

Perfectly packing graphs with bounded degeneracy and many leaves

Peter Allen, Julia Böttcher, Dennis Clemens +1

We prove that one can perfectly pack degenerate graphs into complete or dense $n$ -vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}…

math.CO2019★ 3 cited

Regularity inheritance in hypergraphs

Peter Allen, Ewan Davies, Jozef Skokan

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular par…