Let's say I have a set $S$ and I want all subsets that have two elements. Is there a special name for that?
To put it another way, I want to know if there is a name of the subset of a $S$'s power set that have $n$ elements.
Let's say I have a set $S$ and I want all subsets that have two elements. Is there a special name for that?
To put it another way, I want to know if there is a name of the subset of a $S$'s power set that have $n$ elements.
The standard name is something like the (set of) $n$-subsets. Less common is $n$-combinations.
The number of subsets of size $k$ in a set of size $n$ is often denoted $\dbinom nk$, called "$n$ choose $k$".
The set of all subsets of size $k$ in a set $S$ of size $n$ is sometimes denoted $\dbinom Sk$. For example, $\dbinom{\{a,b,c,d\}}{2} = \{\ \{a,b\}, \{a,c\}, \{a,d\}, \{b,c\}, \{b,d\}, \{c,d\} \ \}$.
I sometimes just call them "size-$k$ subsets of $S$".