dblp.uni-trier.dewww.uni-trier.de

Deryk Osthus

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
36EEDaniela Kühn, Deryk Osthus: Linkedness and Ordered Cycles in Digraphs. Combinatorics, Probability & Computing 17(3): 411-422 (2008)
35EELuke Kelly, Daniela Kühn, Deryk Osthus: A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. Combinatorics, Probability & Computing 17(5): 689-709 (2008)
34EEOliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory, Ser. B 98(3): 484-505 (2008)
33EEDaniela Kühn, Deryk Osthus, Andrew Young: k-Ordered Hamilton cycles in digraphs. J. Comb. Theory, Ser. B 98(6): 1165-1180 (2008)
32EEDaniela Kühn, Deryk Osthus, Andrew Young: A note on complete subdivisions in digraphs of large outdegree. Journal of Graph Theory 57(1): 1-6 (2008)
31EENikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: The order of the largest complete minor in a random graph. Random Struct. Algorithms 33(2): 127-141 (2008)
2007
30EEDaniela Kühn, Deryk Osthus: Maximizing Several Cuts Simultaneously. Combinatorics, Probability & Computing 16(2): 277-283 (2007)
29EENikolaos Fountoulakis, Daniela Kühn, Deryk Osthus: The order of the largest complete minor in a random graph. Electronic Notes in Discrete Mathematics 29: 141-146 (2007)
28EEDaniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus: Ramsey numbers of sparse hypergraphs. Electronic Notes in Discrete Mathematics 29: 29-33 (2007)
27EEDeryk Osthus, Daniela Kühn: A minimum degree condition forcing a digraph to be k-linked. Electronic Notes in Discrete Mathematics 29: 35-39 (2007)
26EEOliver Cooley, Daniela Kühn, Deryk Osthus: Perfect packings with complete graphs minus an edge. Eur. J. Comb. 28(8): 2143-2155 (2007)
2006
25EEDaniela Kühn, Deryk Osthus: Critical chromatic number and the complexity of perfect packings in graphs. SODA 2006: 851-859
24EEDaniela Kühn, Deryk Osthus: Extremal connectivity for topological cliques in bipartite graphs. J. Comb. Theory, Ser. B 96(1): 73-99 (2006)
23EEDaniela Kühn, Deryk Osthus: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Comb. Theory, Ser. B 96(6): 767-821 (2006)
22EEDaniela Kühn, Deryk Osthus: Matchings in hypergraphs of large minimum degree. Journal of Graph Theory 51(4): 269-280 (2006)
21EEDaniela Kühn, Deryk Osthus: Improved Bounds for Topological Cliques in Graphs of Large Girth. SIAM J. Discrete Math. 20(1): 62-78 (2006)
20EEDaniela Kühn, Deryk Osthus: Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. SIAM J. Discrete Math. 20(2): 273-286 (2006)
2005
19EEDaniela Kühn, Deryk Osthus: Packings in Dense Regular Graphs. Combinatorics, Probability & Computing 14(3): 325-337 (2005)
18EEDaniela Kühn, Deryk Osthus: Forcing unbalanced complete bipartite minors. Eur. J. Comb. 26(1): 75-81 (2005)
17EEDaniela Kühn, Deryk Osthus, Anusch Taraz: Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95(2): 263-282 (2005)
16EEDaniela Kühn, Deryk Osthus: Four-cycles in graphs without a given even cycle. Journal of Graph Theory 48(2): 147-156 (2005)
15EEDaniela Kühn, Deryk Osthus: Spanning triangulations in graphs. Journal of Graph Theory 49(3): 205-233 (2005)
2004
14EEDaniela Kühn, Deryk Osthus: Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. Combinatorica 24(1): 155-162 (2004)
13EEDaniela Kühn, Deryk Osthus: Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. Combinatorica 24(2): 287-304 (2004)
12EEDaniela Kühn, Deryk Osthus: Complete Minors In Ks, s-Free Graphs. Combinatorica 25(1): 49-64 (2004)
11 Daniela Kühn, Deryk Osthus: Large Topological Cliques in Graphs Without a 4-Cycle. Combinatorics, Probability & Computing 13(1): 93-102 (2004)
10 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 13(3): 361-371 (2004)
9EEPierce G. Buckley, Deryk Osthus: Popularity based random graph models leading to a scale-free degree sequence. Discrete Mathematics 282(1-3): 53-68 (2004)
2003
8EEDeryk Osthus, Hans Jürgen Prömel, Anusch Taraz: For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? Combinatorica 23(1): 105-150 (2003)
7EEDeryk 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 88(1): 119-134 (2003)
6EEDaniela Kühn, Deryk Osthus: Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory, Ser. B 88(1): 29-43 (2003)
5EEDaniela Kühn, Deryk Osthus: Minors in graphs of large girth. Random Struct. Algorithms 22(2): 213-225 (2003)
2002
4EEDaniela Kühn, Deryk Osthus: Topological Minors in Graphs of Large Girth. J. Comb. Theory, Ser. B 86(2): 364-380 (2002)
2001
3 Deryk Osthus, Anusch Taraz: Random maximal H-free graphs. Random Struct. Algorithms 18(1): 61-82 (2001)
2000
2EEDeryk Osthus: Maximum Antichains in Random Subsets of a Finite Set. J. Comb. Theory, Ser. A 90(2): 336-346 (2000)
1 Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus: The length of random subsets of Boolean lattices. Random Struct. Algorithms 16(2): 177-194 (2000)

Coauthor Index

1Pierce G. Buckley [9]
2Oliver Cooley [26] [28] [34]
3Nikolaos Fountoulakis [28] [29] [31] [34]
4Luke Kelly [35]
5Yoshiharu Kohayakawa [1]
6Bernd Kreuter [1]
7Daniela Kühn [4] [5] [6] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36]
8Hans Jürgen Prömel [7] [8]
9Anusch Taraz [3] [7] [8] [17]
10Andrew Young [32] [33]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)