A note on some embedding problems for oriented graphs

DOI10.1002/jgt.20586zbMath1242.05176arXiv1011.4476MaRDI 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

packings; Ramsey numbers; oriented graphs; Hamilton cycles; transitive tournaments

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C55: Generalized Ramsey theory

05C45: Eulerian and Hamiltonian graphs

Related Items

On Directed Versions of the Hajnal–Szemerédi Theorem, Pósa's conjecture for graphs of order at least 2 × 10⁸, Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree, A survey on Hamilton cycles in directed graphs, Transitive triangle tilings in oriented graphs, Cyclic triangle factors in regular tournaments, TILING DIRECTED GRAPHS WITH 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