DerangementQ[p] tests whether permutation p is a derangement, that is, a permutation without a fixed point.

Derangements[p] constructs all derangements of permutation p.

EmptyQ[g] yields True if graph g contains no edges.

EquivalenceClasses[r] identifies the equivalence classes among the elements of matrix r.

EulerianCycle[g] finds an Eulerian cycle of g if one exists.

Eulerian[n, k] gives the number of permutations of length n with k runs.

ExactRandomGraph[n, e] constructs a random labeled graph of exactly e edges and n vertices.

FerrersDiagram[p] draws a Ferrers diagram of integer partition p.

FindSet[n, s] gives the root of the set containing n in union-find data structure s.

FirstLexicographicTableau[p] constructs the first Young tableau with shape described by partition p.