activity
20102022
most citedDeterministic polynomial-time approximation algorithms for partition functions and graph polynomials

115 citations · 203 across the 24 of their papers we have counts for

collaborators
Showing 2013 · math.COShow all

1 paper · 2 filters

math.CO2013★ 31 cited

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…