1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2020★ 1 cited
A note on colour-bias Hamilton cycles in dense graphs
Andrea Freschi, Joseph Hyde, Joanna Lada +1
Balogh, Csaba, Jing and Pluhár recently determined the minimum degree threshold that ensures a -coloured graph contains a Hamilton cycle of significant colour bias (i.e., a…
math.CO2019
A degree sequence version of the Kühn-Osthus tiling theorem
Joseph Hyde, Andrew Treglown
A fundamental result of Kühn and Osthus [The minimum degree threshold for perfect graph packings, Combinatorica, 2009] determines up to an additive constant the minimum degree thre…