An algorithmic weakening of the Erdős-Hajnal conjecture

Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran +1

We study the approximability of the Maximum Independent Set (MIS) problem in $H$-free graphs (that is, graphs which do not admit $H$ as an induced subgraph). As one motivation we i…