We have a set of sets S = {s1, s2, ..., sn}. We seek a maximal subset of S, such that the sets in that subset are all pairwise disjoint.(adsbygoogle = window.adsbygoogle || []).push({});

How difficult is this? Is it NP-complete? Does this problem have a name?

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Maximal disjoint subset problem

**Physics Forums | Science Articles, Homework Help, Discussion**