query: partitioning of a set with kn members into k subsets such that each subset has n members
positive_passages.docid: 6432
positive_passages.text: How many ways can N elements be partitioned into subsets of size K?
negative_passages.docid: 58749
negative_passages.text: Choose K items from N in a circle
negative_passages.docid: 146664
negative_passages.text: The union of two linearly independent subsets
negative_passages.docid: 82207
negative_passages.text: Number of Pairs of Subsets
negative_passages.docid: 141531
negative_passages.text: Find the set of $n\in\Bbb Z^+$ with $M=\{n,n+1,n+2,n+3,n+4,n+5\}$ partitionable into two sets
negative_passages.docid: 117658
negative_passages.text: A set with n elements has 2^n subsets
negative_passages.docid: 73345
negative_passages.text: maximum size of a $k$-intersecting family of $[n]$
negative_passages.docid: 28877
negative_passages.text: Graph with $k$ components.
negative_passages.docid: 106397
negative_passages.text: Counting ways to partition a set into fixed number of subsets
negative_passages.docid: 43979
negative_passages.text: The total number of subsets is $2^n$ for $n$ elements
negative_passages.docid: 22274
negative_passages.text: Partitioning a natural number $n$ in order to get the maximum product sequence of its addends
negative_passages.docid: 76381
negative_passages.text: Plain integer partitions of $n$ using $r$ parts
negative_passages.docid: 98850
negative_passages.text: A positional number system for enumerating fixed-size subsets?
negative_passages.docid: 6679
negative_passages.text: Counting number of subsets which contain a specific element
negative_passages.docid: 60007
negative_passages.text: Partitions with at most k parts, each of at most l
negative_passages.docid: 123626
negative_passages.text: Prove that even $n$ can be partitioned to $\frac n2$ edges
negative_passages.docid: 43845
negative_passages.text: Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs