3.Next

In mathematics, a uniform matroid is a matroid in which the independent sets are exactly the sets containing at most r elements, for some fixed integer r. An alternative definition is that every permutation of the elements is a symmetry.

Definition

The uniform matroid is defined over a set of elements. A subset of the elements is independent if and only if it contains

3.Next