Finding large $H$-colorable subgraphs in hereditary graph classes

Maria Chudnovsky, Jason King, Michał Pilipczuk +2

We study the \textsc{Max Partial $H$-Coloring} problem: given a graph $G$, find the largest induced subgraph of $G$ that admits a homomorphism into $H$, where $H$ is a fixed patter…