1. A bandwidth theorem for approximate decompositions. Issue 6 (28th November 2018) Authors: Condon, Padraig; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk Journal: Proceedings of the London Mathematical Society Issue: Volume 118:Issue 6(2019) Page Start: 1393 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A domination algorithm for {0, 1}‐instances of the travelling salesman problem1. Issue 3 (8th October 2015) Authors: Kühn, Daniela; Osthus, Deryk; Patel, Viresh Journal: Random structures & algorithms Issue: Volume 48:Issue 3(2016) Page Start: 427 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Counting Hamilton cycles in Dirac hypergraphs. (17th July 2021) Authors: Glock, Stefan; Gould, Stephen; Joos, Felix; Kühn, Daniela; Osthus, Deryk Journal: Combinatorics, probability and computing Issue: Volume 30:Number 4(2021) Page Start: 631 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Dirac's theorem for random regular graphs. (28th January 2021) Authors: Condon, Padraig; Espuny Díaz, Alberto; Girão, António; Kühn, Daniela; Osthus, Deryk Journal: Combinatorics, probability and computing Issue: Volume 30:Number 1(2021) Page Start: 17 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Edge‐disjoint Hamilton cycles in random graphs1. Issue 3 (2nd July 2013) Authors: Knox, Fiachra; Kühn, Daniela; Osthus, Deryk Journal: Random structures & algorithms Issue: Volume 46:Issue 3(2015) Page Start: 397 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Minimalist designs. Issue 1 (11th March 2020) Authors: Barber, Ben; Glock, Stefan; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk Journal: Random structures & algorithms Issue: Volume 57:Issue 1(2020) Page Start: 47 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Path decompositions of tournaments. Issue 2 (19th January 2023) Authors: Girão, António; Granet, Bertille; Kühn, Daniela; Lo, Allan; Osthus, Deryk Journal: Proceedings of the London Mathematical Society Issue: Volume 126:Issue 2(2023) Page Start: 429 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments. Issue 3 (29th May 2014) Authors: Kühn, Daniela; Lapinskas, John; Osthus, Deryk; Patel, Viresh Journal: Proceedings of the London Mathematical Society Issue: Volume 109:Issue 3(2014:Sep.) Page Start: 733 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Rainbow structures in locally bounded colorings of graphs. Issue 4 (13th January 2020) Authors: Kim, Jaehoon; Kühn, Daniela; Kupavskii, Andrey; Osthus, Deryk Journal: Random structures & algorithms Issue: Volume 56:Issue 4(2020) Page Start: 1171 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. The robust component structure of dense regular graphs and applications. Issue 1 (20th October 2014) Authors: Kühn, Daniela; Lo, Allan; Osthus, Deryk; Staden, Katherine Journal: Proceedings of the London Mathematical Society Issue: Volume 110:Issue 1(2015:Jan.) Page Start: 19 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗