Packing and covering directed triangles
classification
🧮 math.CO
keywords
directedtrianglesaffirmativelyanswersarc-disjointarcscasecovering
read the original abstract
We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2t$ arcs in $D$ which meets all directed triangles in $D$, except in the trivial case $t=0$. This answers affirmatively a question of Tuza from 1990.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.