64 citations · 285 across the 44 of their papers we have counts for
9 papers · 1 filter
Edge-decompositions of graphs with high minimum degree
Ben Barber, Daniela Kühn, Allan Lo +1
A fundamental theorem of Wilson states that, for every graph , every sufficiently large -divisible clique has an -decomposition. Here a graph is -divisible if $e(F)…
On-line Ramsey numbers of paths and cycles
Joanna Cyman, Tomasz Dzido, John Lapinskas +1
Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builde…
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
Daniela Kühn, Allan Lo, Deryk Osthus +1
We prove that, for large , every -connected -regular graph on vertices with is Hamiltonian. This is best possible and confirms a conjecture posed independ…
Proof of the 1-factorization and Hamilton decomposition conjectures IV: exceptional systems for the two cliques case
Daniela Kühn, Allan Lo, Deryk Osthus
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large : (i) [1-factorization conjecture] Suppose that is even and…
Proof of the 1-factorization and Hamilton decomposition conjectures III: approximate decompositions
Béla Csaba, Daniela Kühn, Allan Lo +2
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large : (i) [1-factorization conjecture] Suppose that is even and…
Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case
Béla Csaba, Daniela Kühn, Allan Lo +2
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large : (i) [1-factorization conjecture] Suppose that is even and…