Packing edge-disjoint triangles in regular and almost regular tournaments
From MaRDI portal
Publication:472970
DOI10.1016/J.DISC.2014.09.010zbMATH Open1303.05073OpenAlexW2086146973MaRDI QIDQ472970FDOQ472970
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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- The Erdős-Hajnal conjecture. A survey
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- Triangle packings and 1-factors in oriented graphs
- On 4-Cycles and 5-Cycles in Regular Tournaments
- Integer and fractional packings in dense graphs
- Packing transitive triples in a tournament
- Packing triangles in regular tournaments
- Constructive Quasi-Ramsey Numbers and Tournament Ranking
- Title not available (Why is that?)
- Testing subgraphs in directed graphs
- On the number of Mendelsohn and transitive triple systems
- Packing directed cycles efficiently
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)
