EncroachingListSet[p] constructs the encroaching list set associated with permutation p.

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

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

FromInversionVector[v] reconstructs the unique permutation with inversion vector v.

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.

GroetzschGraph returns the smallest triangle-free graph with chromatic number 4. This is identical to MycielskiGraph[4].

HeawoodGraph returns a smallest (6, 3)-cage, a 3-regular graph with girth 6.

LastLexicographicTableau[p] constructs the last Young tableau with shape described by partition p.

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

McGeeGraph returns the unique (7, 3)-cage, a 3-regular graph with girth 7.