Julia Böttcher

activity

20092026

most citedAn approximate version of the Tree Packing Conjecture

30 citations · 114 across the 29 of their papers we have counts for

collaborators

Showing 2019 · math.COShow all

2 papers · 2 filters

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}…