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

79 papers

math.CO2022★ 4 cited

Perfect matchings in random sparsifications of Dirac hypergraphs

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

For all integers $n \geq k > d \geq 1$ , let $m_{d} (k, n)$ be the minimum integer $D \geq 0$ such that every $k$ -uniform $n$ -vertex hypergraph $H$ with minimum $d$ -degree $δ…

math.CO2022★ 2 cited

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

We prove that for $n \in N$ and an absolute constant $C$ , if $p \geq C lo g^{2} n / n$ and $L_{i, j} \subseteq [n]$ is a random subset of $[n]$ where each $k \in [n]$ is include…

math.CO2021

Hypergraph regularity and random sampling

Felix Joos, Jaehoon Kim, Daniela Kühn +1

Suppose a $k$ -uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded numb…

math.CO2021★ 2 cited

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree

Tom Kelly, Daniela Kühn, Deryk Osthus

A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if $G_{1}, \dots, G_{m}$ are nearly disjoint graphs of maximum…

math.CO2021★ 3 cited

Graph and hypergraph colouring via nibble methods: A survey

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a d…

math.CO2020★ 2 cited

Path decompositions of tournaments

António Girão, Bertille Granet, Daniela Kühn +2

In 1976, Alspach, Mason, and Pullman conjectured that any tournament $T$ of even order can be decomposed into exactly $ex (T)$ paths, where ${\rm ex}(T):= \frac{1}{2}\sum_{v\i…