81 citations · 836 across the 70 of their papers we have counts for
3 papers · 2 filters
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…
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Daniela Kühn, John Lapinskas, Deryk Osthus +1
A conjecture of Thomassen from 1982 states that for every k there is an f(k) so that every strongly f(k)-connected tournament contains k edge-disjoint Hamilton cycles. A classical…