Deryk Osthus

发表

Arbitrary Orientations of Hamilton Cycles in Digraphs

Louis DeBiasio, Daniela Kühn, Theodore Molla, 2014, SIAM J. Discret. Math..

The order of the largest complete minor in a random graph

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2007, Electron. Notes Discret. Math..

Fractional clique decompositions of dense graphs and hypergraphs

Daniela Kühn, Deryk Osthus, Allan Lo, 2015, J. Comb. Theory, Ser. B.

Optimal path and cycle decompositions of dense quasirandom graphs

Daniela Kühn, Deryk Osthus, Stefan Glock, 2015, Electron. Notes Discret. Math..

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs

Daniela Kühn, Deryk Osthus, Allan Lo, 2014, J. Comb. Theory, Ser. B.

On the random greedy F-free hypergraph process

Daniela Kühn, Deryk Osthus, Amelia Taylor, 2015, Electron. Notes Discret. Math..

Bipartitions of highly connected tournaments

Daniela Kühn, Deryk Osthus, Jaehoon Kim, 2015, Electron. Notes Discret. Math..

Packings in Dense Regular Graphs

Daniela Kühn, Deryk Osthus, 2005, Comb. Probab. Comput..

Approximate Hamilton decompositions of random graphs

Daniela Kühn, Deryk Osthus, Fiachra Knox, 2012, Random Struct. Algorithms.

Maximizing Several Cuts Simultaneously

Daniela Kühn, Deryk Osthus, 2007, Comb. Probab. Comput..

A proof of Sumner's universal tournament conjecture for large tournaments

Daniela Kühn, Deryk Osthus, Richard Mycroft, 2011, Electron. Notes Discret. Math..

Extremal connectivity for topological cliques in bipartite graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, J. Comb. Theory, Ser. B.

Hamilton decompositions of regular expanders: Applications

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2012, J. Comb. Theory, Ser. B.

Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths

Daniela Kühn, Deryk Osthus, Timothy Townsend, 2016, Comb..

Spanning triangulations in graphs

Daniela Kühn, Deryk Osthus, 2005, J. Graph Theory.

Finding Hamilton cycles in robustly expanding digraphs

Daniela Kühn, Deryk Osthus, Demetres Christofides, 2012, J. Graph Algorithms Appl..

Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, J. Comb. Theory, Ser. B.

Euler Tours in Hypergraphs

Daniela Kühn, Deryk Osthus, Felix Joos, 2018, Comb..

Optimal covers with Hamilton cycles in random graphs

Daniela Kühn, Deryk Osthus, Dan Hefetz, 2014, Comb..

An Ore-type Theorem for Perfect Packings in Graphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2008, SIAM J. Discret. Math..

A domination algorithm for {0, 1}-instances of the travelling salesman problem pdf

Daniela Kühn, Deryk Osthus, Viresh Patel, 2016, Random Struct. Algorithms.

Large Topological Cliques in Graphs Without a 4-Cycle

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2004, Combinatorics, Probability and Computing.

Almost all graphs with high girth and suitable density have high chromatic number

Deryk Osthus, Anusch Taraz, Hans Jürgen Prömel, 2001, J. Graph Theory.

Matchings in 3-uniform hypergraphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2010, J. Comb. Theory, Ser. B.

Deryk Osthus, Pierce G. Buckley, Deryk Osthus, 2004, Discret. Math..

Ramsey numbers of sparse hypergraphs

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2007, Electron. Notes Discret. Math..

Forcing unbalanced complete bipartite minors

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2005, Eur. J. Comb..

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

Daniela Kühn, Deryk Osthus, Luke Kelly, 2007, Combinatorics, Probability and Computing.

Improved Bounds for Topological Cliques in Graphs of Large Girth

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, SIAM J. Discret. Math..

Cycles of given length in oriented graphs

Daniela Kühn, Deryk Osthus, Luke Kelly, 2008, J. Comb. Theory, Ser. B.

Decompositions of complete uniform hypergraphs into Hamilton Berge cycles

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2014, J. Comb. Theory, Ser. A.

Bipartitions of Highly Connected Tournaments

Daniela Kühn, Deryk Osthus, Jaehoon Kim, 2016, SIAM J. Discret. Math..

On the decomposition threshold of a given graph

Daniela Kühn, Deryk Osthus, Richard Montgomery, 2016, J. Comb. Theory, Ser. B.

Large planar subgraphs in dense graphs

Daniela Kühn, Deryk Osthus, Anusch Taraz, 2005, J. Comb. Theory, Ser. B.

Degree sequences forcing Hamilton cycles in directed graphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2009, Electron. Notes Discret. Math..

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

Daniela Kühn, Deryk Osthus, Demetres Christofides, 2010, SIAM J. Discret. Math..

Optimal path and cycle decompositions of dense quasirandom graphs

Daniela Kühn, Deryk Osthus, Stefan Glock, 2015, Electron. Notes Discret. Math..

Hamilton l-cycles in uniform hypergraphs

Daniela Kühn, Deryk Osthus, Richard Mycroft, 2009, J. Comb. Theory, Ser. A.

Random maximal H-free graphs

Deryk Osthus, Anusch Taraz, A. Taraz, 2001, Random Struct. Algorithms.

Perfect packings with complete graphs minus an edge

Daniela Kühn, Deryk Osthus, Oliver Cooley, 2007, Eur. J. Comb..

Minors in graphs of large girth

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2003, Random Struct. Algorithms.

Fractional and integer matchings in uniform hypergraphs

Daniela Kühn, Deryk Osthus, Timothy Townsend, 2013, Eur. J. Comb..

On random planar graphs, the number of planar graphs and their triangulations

Deryk Osthus, Anusch Taraz, Hans Jürgen Prömel, 2003, J. Comb. Theory, Ser. B.

Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments pdf

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2012, ArXiv.

Edge‐disjoint Hamilton cycles in random graphs

Daniela Kühn, Deryk Osthus, Fiachra Knox, 2011, Random Struct. Algorithms.

The order of the largest complete minor in a random graph

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2007, Random Struct. Algorithms.

An approximate version of Sumnerʼs universal tournament conjecture

Daniela Kühn, Deryk Osthus, Richard Mycroft, 2011, J. Comb. Theory, Ser. B.

Partitions of graphs with high minimum degree or connectivity

Daniela Kühn, Deryk Osthus, Deryk Osthus, 2003, J. Comb. Theory, Ser. B.

A note on complete subdivisions in digraphs of large outdegree

Daniela Kühn, Deryk Osthus, Andrew Young, 2008, J. Graph Theory.

Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree

Daniela Kühn, Deryk Osthus, 2004, Comb..

Loose Hamilton cycles in hypergraphs

Daniela Kühn, Deryk Osthus, Peter Keevash, 2008, Discret. Math..

Matchings in 3-uniform hypergraphs of large minimum vertex degree

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2011, Electron. Notes Discret. Math..

k-Ordered Hamilton cycles in digraphs

Daniela Kühn, Deryk Osthus, Andrew Young, 2007, J. Comb. Theory, Ser. B.

Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs

Daniela Kühn, Deryk Osthus, 2006, SIAM J. Discret. Math..

The minimum degree threshold for perfect graph packings

Daniela Kühn, Deryk Osthus, 2009, Comb..

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems

Daniela Kühn, Deryk Osthus, Stefan Glock, 2020, Comb..

Minimalist designs

Daniela Kühn, Deryk Osthus, Allan Lo, 2018, Random Struct. Algorithms.

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2008, J. Comb. Theory, Ser. B.

Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing

Daniela Kühn, Deryk Osthus, Felix Joos, 2019, SIAM J. Discret. Math..

Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs

Deryk Osthus, Katherine Staden, 2013, SIAM J. Discret. Math..

Hamiltonian degree sequences in digraphs

Daniela Kühn, Deryk Osthus, Andrew Treglown, 2008, J. Comb. Theory, Ser. B.

Forbidding induced even cycles in a graph: Typical structure and counting

Daniela Kühn, Deryk Osthus, Timothy Townsend, 2015, J. Comb. Theory B.

A Characterization of Testable Hypergraph Properties

Daniela Kühn, Deryk Osthus, Jaehoon Kim, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs

Daniela Kühn, Deryk Osthus, Jaehoon Kim, 2018, Electron. J. Comb..

On the structure of oriented graphs and digraphs with forbidden tournaments or cycles

Yi Zhao, Daniela Kühn, Deryk Osthus, 2014, J. Comb. Theory, Ser. B.

Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth

Daniela Kühn, Deryk Osthus, 2004, Comb. Probab. Comput..

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Deryk Osthus, Anusch Taraz, Hans Jürgen Prömel, 2003, Comb..

A survey on Hamilton cycles in directed graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2010, Eur. J. Comb..

A minimum degree condition forcing a digraph to be k-linked

Daniela Kühn, Deryk Osthus, Deryk Osthus, 2007, Electron. Notes Discret. Math..

Linkedness and Ordered Cycles in Digraphs

Daniela Kühn, Deryk Osthus, Deryk Osthus, 2007, Combinatorics, Probability and Computing.

Clique decompositions of multipartite graphs and completion of Latin squares

Daniela Kühn, Deryk Osthus, Amelia Taylor, 2016, J. Comb. Theory, Ser. A.

Minors in random regular graphs

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2008, Random Struct. Algorithms.

Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2004, Comb..

Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2006, Comb..

Matchings in hypergraphs of large minimum degree

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, J. Graph Theory.

Edge-disjoint Hamilton cycles in graphs

Daniela Kühn, Deryk Osthus, Demetres Christofides, 2012, J. Comb. Theory, Ser. B.

Topological Minors in Graphs of Large Girth

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2002, J. Comb. Theory, Ser. B.

Complete Minors In Ks,s-Free Graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2004, Comb..

Decompositions into isomorphic rainbow spanning trees

Daniela Kühn, Deryk Osthus, Richard Montgomery, 2019, J. Comb. Theory, Ser. B.

Embedding cycles of given length in oriented graphs

Diana Piguet, Daniela Kühn, Deryk Osthus, 2013, Eur. J. Comb..

Maximum Antichains in Random Subsets of a Finite Set

Deryk Osthus, Deryk Osthus, 2000, J. Comb. Theory, Ser. A.

Four‐cycles in graphs without a given even cycle

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2005, J. Graph Theory.

Critical chromatic number and the complexity of perfect packings in graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2006, SODA '06.

Edge-decompositions of graphs with high minimum degree

Daniela Kühn, Deryk Osthus, Allan Lo, 2014, Electron. Notes Discret. Math..

Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree

Daniela Kühn, Deryk Osthus, John Lapinskas, 2012, Combinatorics, Probability and Computing.

On Pósa's Conjecture for Random Graphs

Daniela Kühn, Deryk Osthus, Daniela Kühn, 2012, SIAM J. Discret. Math..

Short cycles in oriented graphs

Daniela Kühn, Deryk Osthus, Luke Kelly, 2009, Electron. Notes Discret. Math..

Hamiltonicity of random subgraphs of the hypercube

Daniela Kühn, Deryk Osthus, Alberto Espuny Díaz, 2021, SODA.

Counting Hamilton cycles in Dirac hypergraphs

Daniela Kühn, Deryk Osthus, Felix Joos, 2019, Comb. Probab. Comput..

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree pdf

Daniela Kühn, Deryk Osthus, Tom Kelly, 2021, ArXiv.

Graph and hypergraph colouring via nibble methods: A survey pdf

Daniela Kühn, Deryk Osthus, Dong Yeap Kang, 2021, ArXiv.

Hypergraph regularity and random sampling pdf

Daniela Kühn, Deryk Osthus, Felix Joos, 2021, ArXiv.

A proof of the Erd\H{o}s-Faber-Lov\'asz conjecture

Deryk Osthus, Dong Yeap Kang, Abhishek Methuku, 2021 .

Solution to a problem of Erd\H{o}s on the chromatic index of hypergraphs with bounded codegree

Deryk Osthus, Dong Yeap Kang, Abhishek Methuku, 2021, 2110.06181.

Extremal aspects of graph and hypergraph decomposition problems

Daniela Kühn, Deryk Osthus, Stefan Glock, 2021, BCC.

Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments

Deryk Osthus, Viresh Patel, John Lapinskas, 2014 .

Hypergraph $F$-designs for arbitrary $F$

Deryk Osthus, Allan Lo, Stefan Glock, 2017, 1706.01800.

The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$.

Daniela Kühn, Deryk Osthus, Allan Lo, 2020 .

The existence of designs via iterative absorption

Deryk Osthus, Allan Lo, Stefan Glock, 2016 .

Minors in random regular graphs

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2009 .

An exact minimum degree condition for Hamilton cycles in oriented graphs

Deryk Osthus, Peter Keevash, Daniela Kuhn, 2008, 0801.0394.

The robust component structure of dense regular graphs and applications

Deryk Osthus, Allan Lo, Katherine Staden, 2014, 1401.0424.

The order of the largest complete minor in a random graph

Daniela Kühn, Deryk Osthus, Nikolaos Fountoulakis, 2008 .

Matchings in hypergraphs of large minimum degree

Daniela Kühn, Deryk Osthus, 2006 .

Four-cycles in graphs without a given even cycle

Daniela Kühn, Deryk Osthus, 2005 .

Hamilton decompositions of regular tournaments

Deryk Osthus, Andrew Treglown, Daniela Kuhn, 2009, 0908.3411.

Rainbow structures in locally bounded colorings of graphs

Andrey Kupavskii, Deryk Osthus, Jaehoon Kim, 2018 .

Random maximal H-free graphs

Deryk Osthus, Anusch Taraz, 2001 .

Multicoloured Hamilton cycles and perfect matchings in pseudo-random graphs

Daniela Kühn, Deryk Osthus, D. Osthus, 2004 .

On a conjecture of Erd\H{o}s on locally sparse Steiner triple systems

Deryk Osthus, Allan Lo, Stefan Glock, 2018, 1802.04227.