Clique Numbers of Graphs and Irreducible Exact m-Covers of Z

Hao Pan, Li-Lu Zhao

For each m>=1 and k>=2, we construct a graph G=(V,E) with ω(G)=m such that max_{1\leq i\leq k} ω(G[V_i])=m for arbitrary partition V=V_1\cup...\cup V_k, where ω(G) is the clique nu…