A family of counterexamples for a conjecture of Berge on -diperfect digraphs
arXiv:2207.08007
Abstract
Let be a digraph. A stable set of and a path partition of are orthogonal if every path contains exactly one vertex of . In 1982, Berge defined the class of -diperfect digraphs. A digraph is -diperfect if for every maximum stable set of there is a path partition of orthogonal to and this property holds for every induced subdigraph of . An anti-directed odd cycle is an orientation of an odd cycle with in which each vertex is either a source or a sink. Berge conjectured that a digraph is -diperfect if and only if does not contain an anti-directed odd cycle as an induced subdigraph. In this paper, we show that this conjecture is false by exhibiting an infinite family of orientations of complements of odd cycles with at least seven vertices that are not -diperfect.