Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs

Abstract

AbstractA feedback vertex set in a graph is a set of vertices whose removal leaves the remaining graph acyclic. Given the vast number of published results concerning feedback vertex sets, it is surprising that the related combinatorics appears to be so poorly understood. The maximum number of minimal feedback vertex sets in a graph on n vertices is known to be at most 1.864n. However, no examples of graphs having 1.593n or more minimal feedback vertex sets are known, which leaves a considerable gap between these upper and lower bounds on general graphs. In this paper, we close the gap completely for chordal graphs and cographs, two famous perfect graph classes that are not related to each other. We prove that for both of these graph classes, the maximum number of minimal feedback vertex sets is \(10^{\frac{n}{5}} \approx 1.585^n\), and there is a matching lower bound.KeywordsDisjoint UnionMaximal CliqueChordal GraphGraph ClassPerfect GraphThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.