LongestIncreasingSubsequence[p] finds the longest increasing scattered subsequence of permutation p.

LoopPosition is an option to ShowGraph whose values tell ShowGraph where to position a loop around a vertex. This option can take on values UpperLeft, UpperRight, LowerLeft, ...

MakeSimple[g] gives the undirected graph, free of multiple edges and self-loops derived from graph g.

MakeUndirected[g] gives the underlying undirected graph of the given directed graph g.

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

MaximumAntichain[g] gives a largest set of unrelated vertices in partial order g.

MaximumClique[g] finds a largest clique in graph g. MaximumClique[g, k] returns a k-clique, if such a thing exists in g; otherwise it returns {}.

MaximumIndependentSet[g] finds a largest independent set of graph g.

MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.

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