NextKSubset[l, s] gives the k-subset of list l, following the k-subset s in lexicographic order.

NextLexicographicSubset[l, s] gives the lexicographic successor of subset s of set l.

NextPartition[p] gives the integer partition following p in reverse lexicographic order.

NextPermutation[p] gives the permutation following p in lexicographic order.

NextSubset[l, s] constructs the subset of l following subset s in canonical order.

NextTableau[t] gives the tableau of shape t, following t in lexicographic order.

NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.

NormalDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.

NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.

NumberOfDerangements[n] counts the derangements on n elements, that is, the permutations without any fixed points.