no code implementations • 7 Dec 2020 • Ran Gu, Gregory Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu
They also proved that every digraph on at most 6 vertices and arc-connectivity at least 2 has a good pair and gave an example of a 2-arc-strong digraph $D$ on 10 vertices with independence number 4 that has no good pair.
Combinatorics
