An approximate version of Sumner's universal tournament conjecture
From MaRDI portal
Publication:651033
DOI10.1016/j.jctb.2010.12.006zbMath1234.05115arXiv1010.4429OpenAlexW1973167211MaRDI QIDQ651033
Deryk Osthus, Daniela Kühn, Richard Mycroft
Publication date: 8 December 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.4429
Related Items (12)
Cycle partitions of regular graphs ⋮ Spanning trees of dense directed graphs ⋮ Trees contained in every orientation of a graph ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ The robust component structure of dense regular graphs and applications ⋮ A survey on Hamilton cycles in directed graphs ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Unnamed Item ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Orientation Ramsey Thresholds for Cycles and Cliques ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A randomized embedding algorithm for trees
- Hamiltonian degree sequences in digraphs
- On unavoidability of trees with \(k\) leaves
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Trees with three leaves are (\(n+1\))-unavoidable
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Embedding large subgraphs into dense graphs
- Paths and Cycles in Tournaments
- The Algorithmic Aspects of the Regularity Lemma
- Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
- Paths in graphs
- Trees in tournaments
- Trees in tournaments
- Testing subgraphs in directed graphs
- Trees in tournaments
This page was built for publication: An approximate version of Sumner's universal tournament conjecture
