The excluded minors for GF(5)-representable matroids on ten elements

被引:0
|
作者
Brettell, Nick [1 ]
机构
[1] Victoria Univ Wellington, Sch Math & Stat, Wellington, New Zealand
基金
欧洲研究理事会;
关键词
D O I
10.1016/j.aam.2025.102864
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Mayhew and Royle (2008) showed that there are 564 excluded minors for the class of GF(5)-representable matroids having at most 9 elements. We enumerate the excluded minors for GF(5)-representable matroids having 10 elements: there are precisely 2128 such excluded minors. In the process we find, for each i is an element of {2, 3, 4}, the excluded minors for the class of Hi- representable matroids having at most 10 elements, and the excluded minors for the class of H5-representable matroids having at most 13 elements. (c) 2025 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http:// creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:39
相关论文
共 46 条
  • [41] Excluded minors are almost fragile II: Essential elements
    Brettell, Nick
    Oxley, James
    Semple, Charles
    Whittle, Geoff
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 163 : 272 - 307
  • [42] THE EXCLUDED MINORS FOR THREE CLASSES OF 2-POLYMATROIDS HAVING SPECIAL TYPES OF NATURAL MATROIDS
    Bonin, Joseph E.
    Long, Kevin
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (03) : 1715 - 1737
  • [43] Capturing two elements in unavoidable minors of 3-connected binary matroids
    Chun, Deborah
    Oxley, James
    ADVANCES IN APPLIED MATHEMATICS, 2013, 50 (01) : 155 - 175
  • [44] A short proof of non-GF(5)-representability of matroids
    Geelen, J
    Oxley, J
    Vertigan, D
    Whittle, G
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (01) : 105 - 121
  • [45] Spanning cycles in regular matroids without M* (K5) minors
    Lai, Hong-Jian
    Liu, Bolian
    Liu, Yan
    Shao, Yehong
    EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (01) : 298 - 310
  • [46] Maximum-sized matroids with no minors isomorphic to U2,5, F7, F-7 or P7
    Mecay, ST
    COMBINATORICS PROBABILITY & COMPUTING, 2001, 10 (06): : 531 - 542