Design an $\epsilon$-test for the following property in the dense graph model: $G(V,E)$ is a union of three disjoint cliques.I've been sitting for a few hours and I don't have any idea of how to solve this one ... anyone has any ideas / leads?I have tried to pick the vertices randomly and then conclude from the graph they make G' what it says about G , I've divided into cases by connectivity : if the connectivity is 4 or more it is easy to conclude that the Graph do not has the property . i have struggled with the math in the other cases...sorry for not posting my progress (I am new)
Testing the property of being a union of three disjoint cliques
graph theory