Sparse Partitions of Graphs with Bounded Clique Number

António Girão, Toby Insley

We prove that for each integer $r\ge 2$, there exists a constant $C_r>0$ with the following property: for any $0<\epsilon \le 1/2$ and any graph $G$ with clique number at most…