Deryk Osthus

According to our database1, Deryk Osthus authored at least 95 papers between 2000 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Almost all optimally coloured complete graphs contain a rainbow Hamilton path.
J. Comb. Theory, Ser. B, 2022

2021
Decompositions into isomorphic rainbow spanning trees.
J. Comb. Theory, Ser. B, 2021

Counting Hamilton cycles in Dirac hypergraphs.
Comb. Probab. Comput., 2021

Dirac's theorem for random regular graphs.
Comb. Probab. Comput., 2021

Hypergraph regularity and random sampling.
CoRR, 2021

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree.
CoRR, 2021

Graph and hypergraph colouring via nibble methods: A survey.
CoRR, 2021

Hamiltonicity of random subgraphs of the hypercube.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Extremal aspects of graph and hypergraph decomposition problems.
Proceedings of the Surveys in Combinatorics, 2021

2020
Rainbow structures in locally bounded colorings of graphs.
Random Struct. Algorithms, July, 2020

Minimalist designs.
Random Struct. Algorithms, 2020

On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems.
Comb., 2020

Euler Tours in Hypergraphs.
Comb., 2020

2019
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing.
SIAM J. Discret. Math., 2019

On the decomposition threshold of a given graph.
J. Comb. Theory, Ser. B, 2019

Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs.
Electron. J. Comb., 2019

2018
Forbidding induced even cycles in a graph: Typical structure and counting.
J. Comb. Theory, Ser. B, 2018

2017
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles.
J. Comb. Theory, Ser. B, 2017

Clique decompositions of multipartite graphs and completion of Latin squares.
J. Comb. Theory, Ser. A, 2017

Fractional clique decompositions of dense graphs and hypergraphs.
J. Comb. Theory, Ser. B, 2017

A Characterization of Testable Hypergraph Properties.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
A domination algorithm for {0, 1}-instances of the travelling salesman problem.
Random Struct. Algorithms, 2016

Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs.
J. Comb. Theory, Ser. B, 2016

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

2015
Arbitrary Orientations of Hamilton Cycles in Digraphs.
SIAM J. Discret. Math., 2015

Edge-disjoint Hamilton cycles in random graphs.
Random Struct. Algorithms, 2015

On the random greedy F-free hypergraph process.
Electron. Notes Discret. Math., 2015

Bipartitions of highly connected tournaments.
Electron. Notes Discret. Math., 2015

Optimal path and cycle decompositions of dense quasirandom graphs.
Electron. Notes Discret. Math., 2015

Edge-decompositions of graphs with high minimum degree.
Electron. Notes Discret. Math., 2015

2014
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles.
J. Comb. Theory, Ser. A, 2014

Hamilton decompositions of regular expanders: Applications.
J. Comb. Theory, Ser. B, 2014

Fractional and integer matchings in uniform hypergraphs.
Eur. J. Comb., 2014

Optimal covers with Hamilton cycles in random graphs.
Comb., 2014

2013
Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs.
SIAM J. Discret. Math., 2013

Matchings in 3-uniform hypergraphs.
J. Comb. Theory, Ser. B, 2013

Embedding cycles of given length in oriented graphs.
Eur. J. Comb., 2013

Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree.
Comb. Probab. Comput., 2013

2012
On Pósa's Conjecture for Random Graphs.
SIAM J. Discret. Math., 2012

Approximate Hamilton decompositions of random graphs.
Random Struct. Algorithms, 2012

Finding Hamilton cycles in robustly expanding digraphs.
J. Graph Algorithms Appl., 2012

Edge-disjoint Hamilton cycles in graphs.
J. Comb. Theory, Ser. B, 2012

A survey on Hamilton cycles in directed graphs.
Eur. J. Comb., 2012

Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments
CoRR, 2012

2011
An approximate version of Sumnerʼs universal tournament conjecture.
J. Comb. Theory, Ser. B, 2011

Matchings in 3-uniform hypergraphs of large minimum vertex degree.
Electron. Notes Discret. Math., 2011

A proof of Sumner's universal tournament conjecture for large tournaments.
Electron. Notes Discret. Math., 2011

Loose Hamilton cycles in hypergraphs.
Discret. Math., 2011

2010
A Semiexact Degree Condition for Hamilton Cycles in Digraphs.
SIAM J. Discret. Math., 2010

Hamiltonian degree sequences in digraphs.
J. Comb. Theory, Ser. B, 2010

Hamilton <i>l</i>-cycles in uniform hypergraphs.
J. Comb. Theory, Ser. A, 2010

Cycles of given length in oriented graphs.
J. Comb. Theory, Ser. B, 2010

2009
An Ore-type Theorem for Perfect Packings in Graphs.
SIAM J. Discret. Math., 2009

Minors in random regular graphs.
Random Struct. Algorithms, 2009

Short cycles in oriented graphs.
Electron. Notes Discret. Math., 2009

Degree sequences forcing Hamilton cycles in directed graphs.
Electron. Notes Discret. Math., 2009

The minimum degree threshold for perfect graph packings.
Comb., 2009

Embeddings and Ramsey numbers of sparse <i>kappa</i>-uniform hypergraphs.
Comb., 2009

2008
A note on complete subdivisions in digraphs of large outdegree.
J. Graph Theory, 2008

k-Ordered Hamilton cycles in digraphs.
J. Comb. Theory, Ser. B, 2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.
J. Comb. Theory, Ser. B, 2008

Linkedness and Ordered Cycles in Digraphs.
Comb. Probab. Comput., 2008

A Dirac-Type Result on Hamilton Cycles in Oriented Graphs.
Comb. Probab. Comput., 2008

2007
A minimum degree condition forcing a digraph to be k-linked.
Electron. Notes Discret. Math., 2007

Ramsey numbers of sparse hypergraphs.
Electron. Notes Discret. Math., 2007

The order of the largest complete minor in a random graph.
Electron. Notes Discret. Math., 2007

Perfect packings with complete graphs minus an edge.
Eur. J. Comb., 2007

Maximizing Several Cuts Simultaneously.
Comb. Probab. Comput., 2007

2006
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs.
SIAM J. Discret. Math., 2006

Improved Bounds for Topological Cliques in Graphs of Large Girth.
SIAM J. Discret. Math., 2006

Matchings in hypergraphs of large minimum degree.
J. Graph Theory, 2006

Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree.
J. Comb. Theory, Ser. B, 2006

Extremal connectivity for topological cliques in bipartite graphs.
J. Comb. Theory, Ser. B, 2006

Critical chromatic number and the complexity of perfect packings in graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Spanning triangulations in graphs.
J. Graph Theory, 2005

Four-cycles in graphs without a given even cycle.
J. Graph Theory, 2005

Large planar subgraphs in dense graphs.
J. Comb. Theory, Ser. B, 2005

Forcing unbalanced complete bipartite minors.
Eur. J. Comb., 2005

Packings in Dense Regular Graphs.
Comb. Probab. Comput., 2005

2004
Popularity based random graph models leading to a scale-free degree sequence.
Discret. Math., 2004

Subdivisions of K<sub>r+2</sub> in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth.
Comb. Probab. Comput., 2004

Large Topological Cliques in Graphs Without a 4-Cycle.
Comb. Probab. Comput., 2004

Complete Minors In K<sub>s, s</sub>-Free Graphs.
Comb., 2004

Induced Subdivisions In K<sub>s, s</sub>-Free Graphs of Large Average Degree.
Comb., 2004

Every Graph of Sufficiently Large Average Degree Contains a C<sub>4</sub>-Free Subgraph of Large Average Degree.
Comb., 2004

2003
Minors in graphs of large girth.
Random Struct. Algorithms, 2003

On random planar graphs, the number of planar graphs and their triangulations.
J. Comb. Theory, Ser. B, 2003

Partitions of graphs with high minimum degree or connectivity.
J. Comb. Theory, Ser. B, 2003

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Comb., 2003

2002
Topological Minors in Graphs of Large Girth.
J. Comb. Theory, Ser. B, 2002

2001
Random maximal H-free graphs.
Random Struct. Algorithms, 2001

Almost all graphs with high girth and suitable density have high chromatic number.
J. Graph Theory, 2001

2000
The length of random subsets of Boolean lattices.
Random Struct. Algorithms, 2000

Maximum Antichains in Random Subsets of a Finite Set.
J. Comb. Theory, Ser. A, 2000


  Loading...