Packing edge-disjoint triangles in regular and almost regular tournaments

DOI10.1016/J.DISC.2014.09.010MaRDI QIDQ472970zbMATH OpenOpenAlexFDO

Authors Islam Akaria, Raphael Yuster

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

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

Recommendations

• Packing triangles in regular tournaments
• The number of edge-disjoint transitive triples in a tournament
• Cyclic triangle factors in regular tournaments
• Packing transitive triples in a tournament
• The tight bound on the number of \(\vec{C_3}\)-free vertices on regular 3-partite tournaments

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1156643 (Why is no real title available?)
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Integer and fractional packings in dense graphs
• On 4-Cycles and 5-Cycles in Regular Tournaments
• On the number of Mendelsohn and transitive triple systems
• Packing directed cycles efficiently
• Packing transitive triples in a tournament
• Packing triangles in regular tournaments
• Testing subgraphs in directed graphs
• The Erdős-Hajnal conjecture. A survey
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• Triangle packings and 1-factors in oriented graphs

Cited in

(7)

• Packing triangles in regular tournaments
• Cyclic triangle factors in regular tournaments
• The number of edge-disjoint transitive triples in a tournament
• Packing Arc-Disjoint Cycles in Tournaments
• Packing transitive triples in a tournament
• Packing arc-disjoint cycles in tournaments
• Triangle packing in (sparse) tournaments: approximation and kernelization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472970)