22 citations · 93 across the 17 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
On degree sequences forcing the square of a Hamilton cycle
Katherine Staden, Andrew Treglown
A famous conjecture of Pósa from 1962 asserts that every graph on vertices and with minimum degree at least contains the square of a Hamilton cycle. The conjecture was p…
math.CO2014★ 3 cited
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…
math.CO2014★ 16 cited
The robust component structure of dense regular graphs and applications
Daniela Kühn, Allan Lo, Deryk Osthus +1
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully t…