DurfeeSquare[p] gives the number of rows involved in the Durfee square of partition p, the side of the largest-sized square contained within the Ferrers diagram of p.

EdgeChromaticNumber[g] gives the fewest number of colors necessary to color each edge of graph g, so that no two edges incident on the same vertex have the same color.

M[g] gives the number of edges in the graph g. M[g, Directed] is obsolete because M[g] works for directed as well as undirected graphs.

NumberOfTableaux[p] uses the hook length formula to count the number of Young tableaux with shape defined by partition p.

PerfectQ[g] yields True if g is a perfect graph, meaning that for every induced subgraph of g the size of a largest clique equals the chromatic number.

SetPartitions[set] returns the list of set partitions of set. SetPartitions[n] returns the list of set partitions of {1, 2, ..., n}.

RoundToEven is a setting for the option RoundingRule of SetArithmetic that specifies rounding to the nearest representable number and, in the case of a tie, rounding to the ...

RoundToInfinity is a setting for the option RoundingRule of SetArithmetic that specifies rounding to the nearest representable number and, in the case of a tie, rounding away ...

OrderStarSymbolSize is an option to OrderStarPlot that specifies the size of the symbols used to represent poles, zeros and interpolation points.

OrderStarSymbolThickness is an option to OrderStarPlot that specifies the thickness of the outline of the symbols used to represent interpolation points, poles and zeros.