Maximum average degree and relaxed coloring

Michael Kopreski, Gexin Yu

We say a graph is $(d,d,\dots ,d,0,\dots ,0)$-colorable with $a$ of $d$'s and $b$ of $0$'s if $V(G)$ may be partitioned into $b$ independent sets $O_1,O_2,\dots ,O_b$ and $a$…