81 citations · 836 across the 70 of their papers we have counts for
5 papers · 2 filters
Path decompositions of tournaments
António Girão, Bertille Granet, Daniela Kühn +2
In 1976, Alspach, Mason, and Pullman conjectured that any tournament of even order can be decomposed into exactly paths, where ${\rm ex}(T):= \frac{1}{2}\sum_{v\i…
New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
Dong Yeap Kang, Daniela Kühn, Abhishek Methuku +1
Let be a -uniform -regular simple hypergraph on vertices. Based on an analysis of the Rödl nibble, Alon, Kim and Spencer (1997) proved that if , then con…
Extremal aspects of graph and hypergraph decomposition problems
Stefan Glock, Daniela Kühn, Deryk Osthus
We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of in…
Hamiltonicity of random subgraphs of the hypercube
Padraig Condon, Alberto Espuny Díaz, António Girão +2
We study Hamiltonicity in random subgraphs of the hypercube . Our first main theorem is an optimal hitting time result. Consider the random process which includes th…
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
Stephen Gould, Tom Kelly, Daniela Kühn +1
A subgraph of an edge-coloured graph is called rainbow if all of the edges of have different colours. In 1989, Andersen conjectured that every proper edge-colouring of $K_{…