D. Kühn

activity

20052022

most citedHamilton l-cycles in uniform hypergraphs

81 citations · 836 across the 70 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

3 papers · 2 filters

math.CO2015★ 26 cited

Fractional Clique Decompositions of Dense Graphs and Hypergraphs

Ben Barber, Daniela Kühn, Allan Lo +2

Our main result is that every graph $G$ on $n \geq 1 0^{4} r^{3}$ vertices with minimum degree $δ (G) \geq (1 - 1/1 0^{4} r^{3/2}) n$ has a fractional $K_{r}$ -decomposition. Combining this res…

math.CO2015★ 25 cited

Optimal path and cycle decompositions of dense quasirandom graphs

Stefan Glock, Daniela Kühn, Deryk Osthus

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0 < p < 1$ …

math.CO2015

On the random greedy F-free hypergraph process

Daniela Kühn, Deryk Osthus, Amelia Taylor

Let $F$ be a strictly $k$ -balanced $k$ -uniform hypergraph with $e (F) \geq ∣ F ∣ - k + 1$ and maximum co-degree at least two. The random greedy $F$ -free process constructs a maximal $F$ -fr…