5 articles
Gammoid
A gammoid is a matroid defined from a directed graph: a vertex set whose independent subsets are those reachable by vertex-disjoint paths from a starting set.
Graphic matroid
The graphic matroid, also called the cycle matroid, is the matroid on a graph's edges whose independent sets are forests and whose bases are spanning trees.
Partition matroid
A partition matroid is a standard matroid example whose ground set is divided into disjoint parts, with a set independent when it contains at most one element from each part.
Paving matroid
A paving matroid is a matroid in which every circuit has size at least the rank, making it one of the largest classes of matroids.
Uniform matroid
A uniform matroid is a matroid in which every subset of size at most the rank is independent; the rank-t matroid on n elements, U_t,n, has rank function min(t, |A|).