Packing edge-disjoint triangles in regular and almost regular tournaments

DOI10.1016/j.disc.2014.09.010zbMath1303.05073OpenAlexW2086146973MaRDI QIDQ472970

Raphael Yuster, Islam Akaria

Publication date: 20 November 2014

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

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

zbMATH Keywords

fractionalpackingtournament

Mathematics Subject Classification ID

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

Related Items (2)

Packing arc-disjoint cycles in tournaments ⋮ Packing Arc-Disjoint Cycles in Tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of Mendelsohn and transitive triple systems
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• Packing directed cycles efficiently
• Integer and fractional packings in dense graphs
• Packing transitive triples in a tournament
• Triangle packings and 1-factors in oriented graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Packing Triangles in Regular Tournaments
• The Erdös-Hajnal Conjecture-A Survey
• On 4-Cycles and 5-Cycles in Regular Tournaments
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Testing subgraphs in directed graphs

This page was built for publication: Packing edge-disjoint triangles in regular and almost regular tournaments