20 citations · 71 across the 33 of their papers we have counts for
4 papers · 1 filter
The Bandwidth Theorem in Sparse Graphs
Peter Allen, Julia Böttcher, Julia Ehrenmüller +1
The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any -vertex graph with minimum degree contains all -vert…
Blow-up lemmas for sparse graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. Thi…
Almost all trees are almost graceful
Anna Adamaszek, Peter Allen, Codrut Grosu +1
The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that t…
Regularity inheritance in pseudorandom graphs
Peter Allen, Julia Böttcher, Jozef Skokan +1
Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox and Zh…