- Large planar subgraphs in dense graphs Daniela Kuhn, Deryk Osthus and Anusch Taraz
- A SURVEY ON HAMILTON CYCLES IN DIRECTED GRAPHS DANIELA KUHN AND DERYK OSTHUS
- A PROOF OF SUMNER'S UNIVERSAL TOURNAMENT CONJECTURE FOR LARGE TOURNAMENTS
- HAMILTON DECOMPOSITIONS OF REGULAR TOURNAMENTS DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN
- A SIMPLE SOLUTION TO ULAM'S LIAR GAME WITH ONE DERYK OSTHUS AND RACHEL WATKINSON
- PERFECT PACKINGS WITH COMPLETE GRAPHS MINUS OLIVER COOLEY, DANIELA KUHN, AND DERYK OSTHUS
- ON CYCLES IN DIRECTED GRAPHS LUKE TRISTAN KELLY
- Liar Games and Coding Theory Rachel Watkinson 328506
- Ramsey Theory Gregory E. W. Taylor
- The Regularity Lemma and applications to packings Andrew Clark Treglown (512974)
- MSM3P17 Computability Example Sheet 1 All students will be asked to hand in solutions to the first 3 questions for assessment (not all
- MSM3P16 Communication theory Example Sheet 1 All students will be asked to hand in solutions to Questions 13 for assessment (not all of which
- MSM3P16+4P16 Communication theory Example Sheet 2 All students will be asked to hand in solutions to Questions 13 for assessment (not all of
- MSM3P16 Communication theory Example Sheet 3 All students will be asked to hand in solutions to Questions 13 for assessment (not all of which
- AN APPROXIMATE VERSION OF SUMNER'S UNIVERSAL TOURNAMENT CONJECTURE
- On random planar graphs, the number of planar graphs and their triangulations
- Maximum Antichains in Random Subsets of a to appear in Journal of Combinatorial theory, Series A
- Below, I have collected some open problems which I have come across in my research and which I believe are interesting and solvable. I'd be happy to hear
- Random maximal H-free graphs Deryk Osthus and Anusch Taraz
- Randomized Algorithms Philip Keen, supervised by Dr Deryk Osthus
- Popularity based random graph models leading to a scale-free degree sequence
- Communication Theory Charlotte Jones
- The Length of Random Subsets of Boolean Lattices to appear in Random Structures and Algorithms
- MSM3P16 Communication theory Example Sheet 5 All students will be asked to hand in solutions to Questions 13 for assessment (not all
- MSM3P16+4P16 Communication theory Dr. Deryk Osthus
- MINORS IN RANDOM REGULAR GRAPHS NIKOLAOS FOUNTOULAKIS, DANIELA KUHN AND DERYK OSTHUS
- APPROXIMATE HAMILTON DECOMPOSITIONS OF RANDOM FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS
- Extremal connectivity for topological cliques in bipartite graphs
- MSM3P16 Communication theory Example Sheet 4 All students will be asked to hand in solutions to Questions 13 for assessment (not all of which
- MSM3P17 Computability Example Sheet 2 All students will be asked to hand in solutions to the first 3 questions for assessment (not all
- Spanning triangulations in graphs Daniela Kuhn Deryk Osthus
- For which densities are random triangle-free graphs almost surely bipartite?
- LOOSE HAMILTON CYCLES IN HYPERGRAPHS PETER KEEVASH, DANIELA KUHN, RICHARD MYCROFT, AND DERYK OSTHUS
- A NOTE ON COMPLETE SUBDIVISIONS IN DIGRAPHS OF LARGE OUTDEGREE
- MSM3P17 Computability Dr. Deryk Osthus
- HAMILTON DECOMPOSITIONS OF REGULAR TOURNAMENTS DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN