Packing Triangles in Regular Tournaments
From MaRDI portal
Publication:2852611
DOI10.1002/jgt.21691zbMath1272.05068MaRDI QIDQ2852611
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Packing Arc-Disjoint Cycles in Tournaments, Packing edge-disjoint triangles in regular and almost regular 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
- 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
