32 citations · 59 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 20 cited
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…
math.CO2013★ 32 cited
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…