Search results for "Deryk Osthus"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Daniela Kühn, Deryk Osthus	A survey on Hamilton cycles in directed graphs.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
1	Fiachra Knox, Daniela Kühn, Deryk Osthus	Approximate Hamilton decompositions of random graphs.	Random Struct. Algorithms	2012	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments	CoRR	2012	DBLP BibTeX RDF
1	Daniela Kühn, Richard Mycroft, Deryk Osthus	An approximate version of Sumnerʼs universal tournament conjecture.	J. Comb. Theory, Ser. B	2011	DBLP DOI BibTeX RDF
1	Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus	Loose Hamilton cycles in hypergraphs.	Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Luke Kelly, Daniela Kühn, Deryk Osthus	Cycles of given length in oriented graphs.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus, Andrew Treglown	Hamiltonian degree sequences in digraphs.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
1	Daniela Kühn, Richard Mycroft, Deryk Osthus	Hamilton l-cycles in uniform hypergraphs.	J. Comb. Theory, Ser. A	2010	DBLP DOI BibTeX RDF
1	Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus	A Semiexact Degree Condition for Hamilton Cycles in Digraphs.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Deryk Osthus, Luke Kelly, Daniela Kühn	Short cycles in oriented graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus, Andrew Treglown	Degree sequences forcing Hamilton cycles in directed graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus	Minors in random regular graphs.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
1	Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus	Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	The minimum degree threshold for perfect graph packings.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus, Andrew Treglown	An Ore-type Theorem for Perfect Packings in Graphs.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus	3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.	J. Comb. Theory, Ser. B	2008	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus, Andrew Young	k-Ordered Hamilton cycles in digraphs.	J. Comb. Theory, Ser. B	2008	DBLP DOI BibTeX RDF
1	Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus	The order of the largest complete minor in a random graph.	Random Struct. Algorithms	2008	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Linkedness and Ordered Cycles in Digraphs.	Combinatorics, Probability & Computing	2008	DBLP DOI BibTeX RDF
1	Luke Kelly, Daniela Kühn, Deryk Osthus	A Dirac-Type Result on Hamilton Cycles in Oriented Graphs.	Combinatorics, Probability & Computing	2008	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus, Andrew Young	A note on complete subdivisions in digraphs of large outdegree.	Journal of Graph Theory	2008	DBLP DOI BibTeX RDF
1	Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus	The order of the largest complete minor in a random graph.	Electronic Notes in Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus	Ramsey numbers of sparse hypergraphs.	Electronic Notes in Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Deryk Osthus, Daniela Kühn	A minimum degree condition forcing a digraph to be k-linked.	Electronic Notes in Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Oliver Cooley, Daniela Kühn, Deryk Osthus	Perfect packings with complete graphs minus an edge.	Eur. J. Comb.	2007	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Maximizing Several Cuts Simultaneously.	Combinatorics, Probability & Computing	2007	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree.	J. Comb. Theory, Ser. B	2006	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Extremal connectivity for topological cliques in bipartite graphs.	J. Comb. Theory, Ser. B	2006	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs.	SIAM J. Discrete Math.	2006	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Improved Bounds for Topological Cliques in Graphs of Large Girth.	SIAM J. Discrete Math.	2006	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Matchings in hypergraphs of large minimum degree.	Journal of Graph Theory	2006	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Critical chromatic number and the complexity of perfect packings in graphs.	SODA	2006	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus, Anusch Taraz	Large planar subgraphs in dense graphs.	J. Comb. Theory, Ser. B	2005	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Forcing unbalanced complete bipartite minors.	Eur. J. Comb.	2005	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Packings in Dense Regular Graphs.	Combinatorics, Probability & Computing	2005	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Spanning triangulations in graphs.	Journal of Graph Theory	2005	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Four-cycles in graphs without a given even cycle.	Journal of Graph Theory	2005	DBLP DOI BibTeX RDF
1	Pierce G. Buckley, Deryk Osthus	Popularity based random graph models leading to a scale-free degree sequence.	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth.	Combinatorics, Probability & Computing	2004	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Large Topological Cliques in Graphs Without a 4-Cycle.	Combinatorics, Probability & Computing	2004	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Complete Minors In Ks, s-Free Graphs.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C83, 05C35, 05D40
1	Daniela Kühn, Deryk Osthus	Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D40
1	Daniela Kühn, Deryk Osthus	Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D40
1	Daniela Kühn, Deryk Osthus	Partitions of graphs with high minimum degree or connectivity.	J. Comb. Theory, Ser. B	2003	DBLP DOI BibTeX RDF
1	Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz	On random planar graphs, the number of planar graphs and their triangulations.	J. Comb. Theory, Ser. B	2003	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	Minors in graphs of large girth.	Random Struct. Algorithms	2003	DBLP DOI BibTeX RDF
1	Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz	For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?	Combinatorica	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C80, 05A16, 05C35
1	Daniela Kühn, Deryk Osthus	Topological Minors in Graphs of Large Girth.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
1	Deryk Osthus, Anusch Taraz	Random maximal H-free graphs.	Random Struct. Algorithms	2001	DBLP DOI BibTeX RDF
1	Deryk Osthus	Maximum Antichains in Random Subsets of a Finite Set.	J. Comb. Theory, Ser. A	2000	DBLP DOI BibTeX RDF
1	Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus	The length of random subsets of Boolean lattices.	Random Struct. Algorithms	2000	DBLP DOI BibTeX RDF

Publications of "Deryk Osthus" ( http://dblp.L3S.de/Authors/Deryk_Osthus )