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

FiniteGraphs produces a convenient list of all the interesting, finite, parameterless graphs built into Combinatorica.

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

FolkmanGraph returns a smallest graph that is edge-transitive but not vertex-transitive.

FranklinGraph returns a 12-vertex graph that represents a 6-chromatic map on the Klein bottle. It is the sole counterexample to Heawood's map-coloring conjecture.

FromAdjacencyLists[l] constructs an edge list representation for a graph from the given adjacency lists l, using a circular embedding. FromAdjacencyLists[l, v] uses v as the ...

FromAdjacencyMatrix[m] constructs a graph from a given adjacency matrix m, using a circular embedding. FromAdjacencyMatrix[m, v] uses v as the embedding for the resulting ...

FromCycles[{c_1, c_2, ...}] gives the permutation that has the given cycle structure.

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

FromOrderedPairs[l] constructs an edge list representation from a list of ordered pairs l, using a circular embedding. FromOrderedPairs[l, v] uses v as the embedding for the ...