The following pages link to Deryk Osthus (Q256989):
Displaying 50 items.
- On the random greedy \(F\)-free hypergraph process (Q322193) (← links)
- Bipartitions of highly connected tournaments (Q322194) (← links)
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs (Q326810) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- Complete minors in \(K_{s,s}\)-free graphs (Q558314) (← links)
- Loose Hamilton cycles in hypergraphs (Q629193) (← links)
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Embedding cycles of given length in oriented graphs (Q691601) (← links)
- Forcing unbalanced complete bipartite minors (Q703605) (← links)
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree (Q705743) (← links)
- Edge-disjoint Hamilton cycles in graphs (Q713971) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- A simple solution to Ulam's liar game with one lie (Q952012) (← links)
- Cycles of given length in oriented graphs (Q965252) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- Hamilton \(\ell \)-cycles in uniform hypergraphs (Q986125) (← links)
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs (Q987557) (← links)
- Topological minors in graphs of large girth (Q1403927) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- On random planar graphs, the number of planar graphs and their triangulations (Q1405106) (← links)
- Maximum antichains in random subsets of a finite set (Q1570763) (← links)
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths (Q1677541) (← links)
- Forbidding induced even cycles in a graph: typical structure and counting (Q1748271) (← links)
- Popularity based random graph models leading to a scale-free degree sequence (Q1827728) (← links)
- For which densities are random triangle-free graphs almost surely bipartite? (Q1878594) (← links)
- Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree (Q1882146) (← links)
- Matchings in 3-uniform hypergraphs (Q1945999) (← links)
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments (Q1946787) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- On the decomposition threshold of a given graph (Q2338634) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Fractional clique decompositions of dense graphs and hypergraphs (Q2407383) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles (Q2452426) (← links)
- Perfect packings with complete graphs minus an edge (Q2461771) (← links)
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers (Q2483473) (← links)
- Large planar subgraphs in dense graphs (Q2573646) (← links)
- Extremal connectivity for topological cliques in bipartite graphs (Q2581501) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- Almost all graphs with high girth and suitable density have high chromatic number (Q2746204) (← links)
- A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158) (← links)
- Degree sequences forcing Hamilton cycles in directed graphs (Q2851487) (← links)
- Short cycles in oriented graphs (Q2851491) (← links)
