Make a directed graph out of the set of edges where an edge indicates the the sets are not disjoint . Now question is to remove min no of sets so that no sets exist.
for this apply the following algo 1.Select the edge with of min degree(nonzero) delete its parent. 2.repeat the step 1 on the modified graph. --
