query: Find all ways to partition a set into given-sized subsets
positive_passages.docid: 8149
positive_passages.text: Algorithm to return all combinations of k elements from n
negative_passages.docid: 139078
negative_passages.text: Infinite partition of $\mathbb N$ by infinite subsets
negative_passages.docid: 135743
negative_passages.text: Collection of subset generating every pairs of elements
negative_passages.docid: 67702
negative_passages.text: Minimal dense subset
negative_passages.docid: 64519
negative_passages.text: Subsets of a list
negative_passages.docid: 141379
negative_passages.text: All groups where underlying set has at most 4 elements
negative_passages.docid: 147181
negative_passages.text: Concise way to generate multiset lists
negative_passages.docid: 17410
negative_passages.text: Get all possible partitions of number
negative_passages.docid: 132605
negative_passages.text: Finding the number of subsets of a set such that an element divides the succeeding element.
negative_passages.docid: 52342
negative_passages.text: Partition rectangle into finite number of squares
negative_passages.docid: 117672
negative_passages.text: finding largest increasing subset of an array (non-contiguous)
negative_passages.docid: 117658
negative_passages.text: A set with n elements has 2^n subsets
negative_passages.docid: 96086
negative_passages.text: Double Factorial: Number of possibilities to partition a set of $2n$ items into $n$ pairs
negative_passages.docid: 28496
negative_passages.text: Generating the partitions of a number
negative_passages.docid: 93748
negative_passages.text: Alternative to Subsets to generate k-combinations
negative_passages.docid: 101179
negative_passages.text: Partition of a set and Hall's theorem
negative_passages.docid: 153174
negative_passages.text: How can I get every distinct size-n combination of a list?