OurBigBook About$ Donate
 Sign in Sign up

Matroid isomorphism (ϕ:E→E′)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Matroid
2026-10-24  0 By others on same topic  0 Discussions Create my own version
A matroid isomorphism between (E,I) and (E′,I′) is a bijection ϕ such that I∈I if and only if ϕ(I)∈I′. It relabels the ground set without changing independence. The number of labelled matroids therefore differs from the number of types up to matroid isomorphism.

 Ancestors (5)

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

 Incoming links (3)

  • Matroid isomorphism
  • Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 2 / b / ii / Solution
  • Small matroid enumeration

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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