- A SURVEY ON HAMILTON CYCLES IN DIRECTED GRAPHS DANIELA KUHN AND DERYK OSTHUS
- AN APPROXIMATE VERSION OF SUMNER'S UNIVERSAL TOURNAMENT CONJECTURE
- Maximizing several cuts simultaneously Daniela Kuhn Deryk Osthus
- Loose Hamilton cycles in 3uniform hypergraphs of high minimum degree
- Matchings in hypergraphs of large minimum degree Daniela Kuhn Deryk Osthus
- THE MINIMUM DEGREE THRESHOLD FOR PERFECT GRAPH DANIELA KUHN AND DERYK OSTHUS
- A DIRAC TYPE RESULT ON HAMILTON CYCLES IN ORIENTED LUKE KELLY, DANIELA KUHN AND DERYK OSTHUS
- Topological minors in graphs of large girth Daniela Kuhn Deryk Osthus
- On Infinite Cycles I To the memory of C.St.J.A. Nash-Williams
- A PROOF OF SUMNER'S UNIVERSAL TOURNAMENT CONJECTURE FOR LARGE TOURNAMENTS
- Fourcycles in graphs without a given even cycle Daniela Kuhn Deryk Osthus
- Spanning triangulations in graphs Daniela Kuhn Deryk Osthus
- EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS DEMETRES CHRISTOFIDES, DANIELA KUHN AND DERYK OSTHUS
- On Infinite Cycles II To the memory of C.St.J.A. Nash-Williams
- Minors in graphs of large girth Daniela Kuhn Deryk Osthus
- APPROXIMATE HAMILTON DECOMPOSITIONS OF RANDOM FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS
- HAMILTONIAN DEGREE SEQUENCES IN DIGRAPHS DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN
- MINORS IN RANDOM REGULAR GRAPHS NIKOLAOS FOUNTOULAKIS, DANIELA KUHN AND DERYK OSTHUS
- AN ORE-TYPE THEOREM FOR PERFECT PACKINGS IN GRAPHS DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN
- THE ORDER OF THE LARGEST COMPLETE MINOR IN A RANDOM NIKOLAOS FOUNTOULAKIS, DANIELA KUHN AND DERYK OSTHUS
- A NOTE ON COMPLETE SUBDIVISIONS IN DIGRAPHS OF LARGE OUTDEGREE
- Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs
- Forcing unbalanced complete bipartite minors Daniela Kuhn Deryk Osthus
- Large topological cliques in graphs without a 4-cycle Daniela Kuhn Deryk Osthus
- Minor-universal planar graphs without accumulation Daniela Kuhn
- MSMP16b Combinatorics Daniela Kuhn
- MSMP16b Combinatorics Examples III The example class for this problem sheet will be on Tuesday 22nd February. Solutions to Questions 14
- MSMP16b Combinatorics Examples V The example class for this problem sheet will be on Tuesday 22nd March. Solutions to Questions 1, 2(a),
- Improved bounds for topological cliques in graphs of large girth
- Complete minors in K s;s -free graphs
- CYCLES OF GIVEN LENGTH IN ORIENTED GRAPHS LUKE KELLY, DANIELA KUHN AND DERYK OSTHUS
- EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS
- HAMILTON -CYCLES IN UNIFORM HYPERGRAPHS DANIELA KUHN, RICHARD MYCROFT, AND DERYK OSTHUS
- Subdivisions of Kr+2 in graphs of average degree at least r + and large but constant girth
- Graph Minor Hierarchies Reinhard Diestel & Daniela Kuhn
- MSMP16b Combinatorics Examples II The example class for this problem sheet will be on Tuesday 8th February. Solutions to Questions 15
- Large planar subgraphs in dense graphs Daniela Kuhn, Deryk Osthus and Anusch Taraz
- Induced subdivisions in K s;s -free graphs of large average degree
- Packings in dense regular graphs Daniela Kuhn Deryk Osthus
- Extremal connectivity for topological cliques in bipartite graphs
- MSMP16b Combinatorics Examples I The example class for this problem sheet will be on Tuesday 25th January. Solutions to Questions 14,
- Graph-theoretical versus topological ends of graphs Reinhard Diestel & Daniela Kuhn
- A universal planar graph under the minor relation Reinhard Diestel Daniela Kuhn
- Forcing a K r minor by high external connectivity
- PERFECT PACKINGS WITH COMPLETE GRAPHS MINUS OLIVER COOLEY, DANIELA KUHN, AND DERYK OSTHUS
- Topological Paths, Cycles and Spanning Trees in Infinite Graphs
- MSMP15 Graph Theory A Examples III The example class for this problem sheet will be on Wednesday 9th November. Solutions to Questions
- MSMP15 Graph Theory A Examples I The example class for this problem sheet will be on Wednesday 12th October. Solutions to Questions
- Embedding cycles of given length in oriented graphs Daniela Kuhn, Deryk Osthus, Diana Piguet
- Syllabus MSMP15a Graph Theory Daniela Kuhn
- MSMP15 Graph Theory A Examples II The example class for this problem sheet will be on Wednesday 26th October. Solutions to Questions 1,
- HAMILTON DECOMPOSITIONS OF REGULAR EXPANDERS: APPLICATIONS
- EDGE-DISJOINT HAMILTON CYCLES IN RANDOM GRAPHS FIACHRA KNOX, DANIELA KUHN AND DERYK OSTHUS
- MSMP15 Graph Theory A Examples V The example class for this problem sheet will be on Wednesday 7th December. Solutions
- MSMP15 Graph Theory A Examples IV The example class for this problem sheet will be on Wednesday 23rd November. Solu-
- HAMILTON DECOMPOSITIONS OF REGULAR EXPANDERS: A PROOF OF KELLY'S CONJECTURE FOR LARGE
