Decomposing oriented graphs into transitive tournaments

DOI10.1016/j.disc.2005.11.008zbMath1086.05036OpenAlexW1989274827MaRDI QIDQ817766

Raphael Yuster

Publication date: 20 March 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.008

zbMATH Keywords

decomposition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Near perfect coverings in graphs and hypergraphs
• The number of edge-disjoint transitive triples in a tournament
• Mathematical Foundations of Computer Science 2004
• The Representation of a Graph by Set Intersections
• Disproof of a conjecture of Erdös and moser on tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing oriented graphs into transitive tournaments