The number of edge-disjoint transitive triples in a tournament

DOI10.1016/j.disc.2004.07.005zbMath1050.05062arXivmath/0304180OpenAlexW2003248663MaRDI QIDQ1886364

Raphael Yuster

Publication date: 18 November 2004

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

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

zbMATH Keywords

TournamentTransitive triple

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Decomposing oriented graphs into transitive tournaments

Cites Work

• On the number of Mendelsohn and transitive triple systems
• Near perfect coverings in graphs and hypergraphs
• On tournaments free of large transitive subtournaments
• Packing triangles in a graph and its complement
• Disproof of a conjecture of Erdös and moser on tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of edge-disjoint transitive triples in a tournament