A note on some embedding problems for oriented graphs

DOI10.1002/jgt.20586zbMath1242.05176arXiv1011.4476OpenAlexW1511503743MaRDI QIDQ2891043

Andrew Treglown

Publication date: 13 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.4476

zbMATH Keywords

packingsRamsey numbersoriented graphsHamilton cyclestransitive tournaments

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

A survey on Hamilton cycles in directed graphs ⋮ On Directed Versions of the Hajnal–Szemerédi Theorem ⋮ Pósa's conjecture for graphs of order at least 2 × 10⁸ ⋮ On the restricted isometry property of the Paley matrix ⋮ Transitive triangle tilings in oriented graphs ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Cyclic triangle factors in regular tournaments ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ Tight bounds for powers of Hamilton cycles in tournaments

Cites Work

• Unnamed Item
• Powers of Hamilton cycles in tournaments
• Triangle packings and 1-factors in oriented graphs
• Decomposition of large combinatorial structures
• Proof of the Seymour conjecture for large graphs
• On tournaments and their largest transitive subtournaments
• On tournaments free of large transitive subtournaments
• Tiling transitive tournaments and their blow-ups
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Hamilton Cycles in Oriented Graphs
• Disproof of a conjecture of Erdös and moser on tournaments
• Some Theorems on Abstract Graphs

This page was built for publication: A note on some embedding problems for oriented graphs