MycielskiGraph[k] returns a triangle-free graph with chromatic number k, for any positive integer k.
NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.
NumberOfPermutationsByCycles[n, m] gives the number of permutations of length n with exactly m cycles.
RandomKSubset[l, k] gives a random subset of set l with exactly k elements.
RealizeDegreeSequence[s] constructs a semirandom graph with degree sequence s.
ResidualFlowGraph[g, flow] returns the directed residual flow graph for graph g with respect to flow.
ToInversionVector[p] gives the inversion vector associated with permutation p.
Uniquely3ColorableGraph returns a 12-vertex, triangle-free graph with chromatic number 3 that is uniquely 3-colorable.
PackedArrayForm[expr] prints with packed arrays in expr shown in summary form, without all their elements explicitly given.