Packing and covering directed triangles
Combinatorics
2019-03-11 v2
Abstract
We prove that if a directed multigraph has at most pairwise arc-disjoint directed triangles, then there exists a set of less than arcs in which meets all directed triangles in , except in the trivial case . This answers affirmatively a question of Tuza from 1990.
Cite
@article{arxiv.1806.08809,
title = {Packing and covering directed triangles},
author = {Jessica McDonald and Gregory J. Puleo and Craig Tennenhouse},
journal= {arXiv preprint arXiv:1806.08809},
year = {2019}
}
Comments
4 pages, 1 figure. The previous version had an error in the argument for the strict inequality in the case where digons are permitted; this version fixes the error