25 citations · 31 across the 3 of their papers we have counts for
4 papers · 1 filter
Edge correlations in random regular hypergraphs and applications to subgraph testing
Alberto Espuny Díaz, Felix Joos, Daniela Kühn +1
Compared to the classical binomial random (hyper)graph model, the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of differe…
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 …
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
Deryk Osthus, Daniela Kühn, Timothy Townsend +1
Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle…
Approximate Hamilton decompositions of robustly expanding regular digraphs
Deryk Osthus, Katherine Staden
We show that every sufficiently large r-regular digraph G which has linear degree and is a robust outexpander has an approximate decomposition into edge-disjoint Hamilton cycles, i…