30 citations · 114 across the 29 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
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…
math.CO2016
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…
math.CO2016★ 2 cited
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…