共 12 条
Packing and Covering Directed Triangles
被引:3
作者:
McDonald, Jessica
[1
]
Puleo, Gregory J.
[1
]
Tennenhouse, Craig
[2
]
机构:
[1] Auburn Univ, Dept Math & Stat, Auburn, AL 36849 USA
[2] Univ New England, Dept Math Sci, Biddeford, ME 04005 USA
关键词:
Digraphs;
Packing;
Covering;
Triangles;
CONJECTURE;
GRAPHS;
D O I:
10.1007/s00373-020-02167-8
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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.
引用
收藏
页码:1059 / 1063
页数:5
相关论文