Hello everyone,

I have a question please regarding the relation between the max-k-cut problem (with a constraint on the cluster's size, i.e., a capacity) and the k-partial clique covering of the index coding problem. Are they equivalent? If not, what are the differences?

Many Thanks,

Yehya.