Covering minimal separators and potential maximal cliques in Pt-free graphs

Abstract

A graph is called Pt-free if it does not contain a t-vertex path as an induced subgraph. While P4-free graphs are exactly cographs, the structure of Pt-free graphs for t ≥ 5 remains not well-undestood. On one hand, classic computational problems such as Maximum Weight Independent Set (MWIS) and 3-Coloring are not known to be NP-hard on Pt-free graphs for any fixed t. On the other hand, despite significant effort, polynomial-time algorithms for MWIS in P6-free graphs [SODA 2019] and 3-Coloring in P7-free graphs [Combinatorica 2018] have been found only recently. In both cases, the algorithms rely on deep structural insights into the considered graph classes. One of the main tools in the algorithms for MWIS in P5-free graphs [SODA 2014] and in P6-free graphs [SODA 2019] is the so-called Separator Covering Lemma that asserts that every minimal separator in the graph can be covered by the union of neighborhoods of a constant number of vertices. In this note we show that such a statement generalizes to P7-free graphs and is false in P8-free graphs. We also discuss analogues of such a statement for covering potential maximal cliques with unions of neighborhoods.