当前位置: X-MOL 学术Graphs Comb. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Packing and Covering Directed Triangles
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2020-04-11 , DOI: 10.1007/s00373-020-02167-8
Jessica McDonald , Gregory J. Puleo , Craig Tennenhouse

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.



中文翻译:

包装和覆盖定向三角形

我们证明了如果一个有向重d具有至多成对弧不相交的指向三角形,则存在一组小于2个的在弧d满足所有定向三角形d,除了在简单的情况\(t = 0时\)。这肯定回答了1990年以来的Tuza问题。

更新日期:2020-06-19
down
wechat
bug