Computing Excluded Minors for Classes of Matroids Representable over Partial Fields
We describe an implementation of a computer search for the "small" excluded minors for a class of matroids representable over a partial field. Using these techniques, we enumerate the excluded minors on at most 15 elements for both the class of dyadic matroids, and the class of 2-regular matroids. We conjecture that there are no other excluded minors for the class of 2-regular matroids; whereas, on the other hand, we show that there is a 16-element excluded minor for the class of dyadic matroids.
Authors
- Rudi Pendavingh
- Nick Brettell (ORCID: https://orcid.org/0000-0002-1136-418X)
Institutions
- Victoria University of Wellington (NZ)
- Eindhoven University of Technology (NL)
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2024-08-23
- DOI
- https://doi.org/10.37236/12078
- Citations
- 3
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 1.04
Funders
- Marsden Fund