On transversals in minimal imperfect graphs Original Research Article

Chvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most α + ω − 1 which meets every ω-clique and every α-stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Bergeʹs strong perfect graph conjecture for a very large class of graphs, namely for those graphs whose diameter does not exceed 6.