RandomPartition[n] constructs a random partition of integer n.
RandomTableau[p] constructs a random Young tableau of shape p.
RandomTree[n] constructs a random labeled tree on n vertices.
RandomVertices[g] assigns a random embedding to graph g.
RankGraph[g, l] partitions the vertices into classes based on the shortest geodesic distance to a member of list l.
RankRGF
(Combinatorica Package Symbol) RankRGF[f] returns the rank of a restricted growth function (RGF) f in the lexicographic order of all RGFs.
RealizeDegreeSequence[s] constructs a semirandom graph with degree sequence s.
RegularQ[g] yields True if g is a regular graph.
ReverseEdges[g] flips the directions of all edges in a directed graph.
RGFQ
(Combinatorica Package Symbol) RGFQ[l] yields True if l is a restricted growth function. It yields False otherwise.