Is there an algorithm that will choose M maximally disjoint out of N sets?

Question

Mathematics

Is there an algorithm that will choose M maximally disjoint out of N sets?

Answer 1

I love such questions - the answer is at least 1. Is the answer counted? ;-)

Answer 2

If you take the first element, delete it in the second set, and so on), as a result, the second set will contain all the elements that do not intersect with the first.