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 2026 · math.COShow all

3 papers · 2 filters

math.CO2026

Local Resilience for Containment of Bounded Degree Spanning Subgraphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1

We prove that for all $Δ \geq 2$ and $γ > 0$ , there exists a constant $C = C (Δ, γ)$ such that for $p \geq C (lo g n / n)^{1/Δ}$ , asymptotically almost surely, every spanning subgraph $G$ …

math.CO2026

A generalised transference principle

Peter Allen, Julia Böttcher, Joanna Lada +1

The last two decades have witnessed a growing trend towards proving sparse random analogues of combinatorial theorems. One unified approach to proving such theorems, formalised by…

math.CO2026

Breaking the Bollobás-Eldridge-Catlin Barrier for Bipartite Graphs

Peter Allen, Julia Böttcher, Jozef Skokan +1

The celebrated Bollobás-Eldridge-Catlin packing conjecture states that every $n$ -vertex graph $G$ with minimum degree at least $(1 - \frac{1}{Δ + 1}) n$ contains every $n$ -vert…