Fractional cocoloring of graphs

John Gimbel, André Kündgen, Michael Molloy

The cochromatic number $Z(G)$ of a graph $G$ is the fewest number of colors needed to color the vertices of $G$ so that each color class is a clique or an independent set. In a fra…