English

Computing excluded minors for classes of matroids representable over partial fields

Combinatorics 2024-08-27 v2

Abstract

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.

Keywords

Cite

@article{arxiv.2302.13175,
  title  = {Computing excluded minors for classes of matroids representable over partial fields},
  author = {Nick Brettell and Rudi Pendavingh},
  journal= {arXiv preprint arXiv:2302.13175},
  year   = {2024}
}

Comments

21 pages, 3 figures

R2 v1 2026-06-28T08:49:36.441Z