Abstract

Let D be a digraph. A stable set S of D and a path partition P of D are orthogonal if every path P∈P contains exactly one vertex of S. In 1982, Berge defined the class of α-diperfect digraphs. A digraph D is α-diperfect if for every maximum stable set S of D there is a path partition P of D orthogonal to S and this property holds for every induced subdigraph of D. An anti-directed odd cycle is an orientation of an odd cycle (x0,…,x2k,x0) with k≥2 in which each vertex x0,x1,x2,x3,x5,x7,…,x2k−1 is either a source or a sink. Berge conjectured that a digraph D is α-diperfect if and only if D 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call