Packing triangles in regular tournaments
From MaRDI portal
Recommendations
Cites work
- Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
- Constructive Quasi-Ramsey Numbers and Tournament Ranking
- Disjoint color-avoiding triangles
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 1156643 (Why is no real title available?)
- Integer and fractional packing of families of graphs
- Integer and fractional packings in dense graphs
- On 4-Cycles and 5-Cycles in Regular Tournaments
- On Sets of Acquaintances and Strangers at any Party
- On the number of Mendelsohn and transitive triple systems
- Packing Cliques in Graphs with Independence Number 2
- Packing directed cycles efficiently
- Packing transitive triples in a tournament
- Packing triangles in a graph and its complement
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- Triangle packings and 1-factors in oriented graphs
Cited in
(7)- Packing transitive triples in a tournament
- Packing and covering directed triangles
- Packing arc-disjoint cycles in tournaments
- Directed simplices in higher order tournaments
- Packing edge-disjoint triangles in regular and almost regular tournaments
- Packing Arc-Disjoint Cycles in Tournaments
- Triangle packing in (sparse) tournaments: approximation and kernelization
This page was built for publication: Packing triangles in regular tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852611)