OurBigBook About$ Donate
 Sign in Sign up

Uniform matroid (Ur,n​)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Matroid
2026-10-24  1 By others on same topic  0 Discussions Create my own version
For 0≤r≤n, the uniform matroid Ur,n​ on an n-element ground set has as its matroid independent sets exactly the subsets of cardinality at most r. Heredity is immediate, and augmentation works because any smaller such subset can acquire an element of a larger one without exceeding r. Its rank of a matroid on A is min{∣A∣,r}.

 Ancestors (5)

  1. Matroid
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (3)

  • Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / b / ii / Solution
  • Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / b / i / Solution
  • Uniform matroid

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Uniform matroid by Wikipedia Bot  1
 View more
A **uniform matroid** is a specific type of matroid that can be characterized by its rank, \( r \). In a uniform matroid, any subset of elements with size less than or equal to \( r \) is independent, while any subset of size greater than \( r \) is dependent.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook