Packing Triangles in Regular Tournaments

DOI10.1002/jgt.21691zbMath1272.05068OpenAlexW1652576638MaRDI QIDQ2852611

Raphael Yuster

Publication date: 9 October 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21691

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 (3)

Packing arc-disjoint cycles in tournaments ⋮ Packing edge-disjoint triangles in regular and almost regular tournaments ⋮ Packing Arc-Disjoint Cycles in Tournaments

Cites Work

• 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
• Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
• Packing triangles in a graph and its complement
• On Sets of Acquaintances and Strangers at any Party
• On 4-Cycles and 5-Cycles in Regular Tournaments
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Integer and fractional packing of families of graphs
• Disjoint Color-Avoiding Triangles
• Packing Cliques in Graphs with Independence Number 2
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing Triangles in Regular Tournaments