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 2014Show all

5 papers · 1 filter

math.CO2014

Tight cycles and regular slices in dense hypergraphs

Peter Allen, Julia Böttcher, Oliver Cooley +1

We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these…

math.CO2014★ 30 cited

An approximate version of the Tree Packing Conjecture

Julia Böttcher, Jan Hladký, Diana Piguet +1

We prove that for any pair of constants $ε > 0$ and $Δ$ and for $n$ sufficiently large, every family of trees of orders at most $n$ , maximum degrees at most $Δ$ , and with at most $\b…

math.CO2014★ 20 cited

A density Corrádi-Hajnal Theorem

Peter Allen, Julia Böttcher, Jan Hladký +1

We find, for all sufficiently large $n$ and each $k$ , the maximum number of edges in an $n$ -vertex graph which does not contain $k + 1$ vertex-disjoint triangles. This extends a resu…

math.CO2014

An extension of Turán's Theorem, uniqueness and stability

Peter Allen, Julia Böttcher, Jan Hladký +1

We determine the maximum number of edges of an $n$ -vertex graph $G$ with the property that none of its $r$ -cliques intersects a fixed set $M \subset V (G)$ . For $(r - 1) ∣ M ∣ \geq n$ , the…

math.CO2014

Powers of Hamilton cycles in pseudorandom graphs

Peter Allen, Julia Böttcher, Hiep Hàn +2

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(ε, p, k, ℓ)$ …