32 citations · 59 across the 4 of their papers we have counts for
4 papers
Forbidding induced even cycles in a graph: typical structure and counting
Jaehoon Kim, Daniela Kühn, Deryk Osthus +1
We determine, for all , the typical structure of graphs that do not contain an induced -cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the…
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…
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Daniela Kühn, Deryk Osthus, Timothy Townsend
In 1982 Thomassen asked whether there exists an integer f(k,t) such that every strongly f(k,t)-connected tournament T admits a partition of its vertex set into t vertex classes V_1…
Fractional and integer matchings in uniform hypergraphs
Daniela Kühn, Deryk Osthus, Timothy Townsend
Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of…