Cover Image

Computing excluded minors for classes of matroids representable over partial fields

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brettell, Nick, Pendavingh, Rudi
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The excluded minors for GF(5)-representable matroids on ten elements
by: Brettell, Nick
Published: (2023)

The excluded minors of the class of spike minors
by: Bastida, Sam, et al.
Published: (2025)

Bounds on the number of cells and the dimension of the Dressian
by: Pendavingh, Rudi
Published: (2024)

Lattice path matroids: the excluded minors
by: Bonin, Joseph E.
Published: (2009)

The excluded 3-minors for vf-safe delta-matroids
by: Bonin, Joseph E, et al.
Published: (2018)

The excluded minors for three classes of 2-polymatroids having special types of natural matroids
by: Bonin, Joseph E., et al.
Published: (2022)

The excluded minors for the intersection of bicircular and lattice path matroids
by: Hogan, Emma, et al.
Published: (2023)

Clonal cores and flexipaths in matroids
by: Brettell, Nick, et al.
Published: (2024)

Detachable pairs in $3$-connected matroids and simple $3$-connected graphs
by: Brettell, Nick, et al.
Published: (2024)

What is a 4-connected matroid?
by: Brettell, Nick, et al.
Published: (2023)

Classes of binary matroids with small lists of excluded induced minors
by: Douthitt, James Dylan, et al.
Published: (2024)

Representability of orthogonal matroids over partial fields
by: Baker, Matthew, et al.
Published: (2022)

A new minor-closed class of transversal matroids
by: Toft, Gerry
Published: (2025)

Evolution of random representable matroids: minors, circuits, connectivity and the critical number
by: Gao, Pu, et al.
Published: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Product structure of graphs with an excluded minor
by: Illingworth, Freddie, et al.
Published: (2021)

Generalized spikes with circuits and cocircuits of different cardinalities
by: Brettell, Nick, et al.
Published: (2022)

Weak diameter choosability of graphs with an excluded minor
by: Crouch, Joshua, et al.
Published: (2023)

Von Staudt Constructions for Skew-Linear and Multilinear Matroids
by: Kühne, Lukas, et al.
Published: (2020)

The minors of matroids with an adjoint
by: Grace, Kevin
Published: (2025)

A characterization of positroids, with applications to amalgams and excluded minors
by: Bonin, Joseph E.
Published: (2023)

An excluded minor theorem for the 6-wheel
by: Chen, Zijun, et al.
Published: (2026)

On the circuits of splitting matroids representable over GF(p)
by: Malavadkar, Prashant, et al.
Published: (2021)

Binary matroids and degree-boundedness for pivot-minors
by: Campbell, Rutger, et al.
Published: (2025)

An infinite family of excluded minors for strong base-orderability
by: Bonin, Joseph E., et al.
Published: (2015)

Linear bounds on treewidth in terms of excluded planar minors
by: Gollin, J. Pascal, et al.
Published: (2024)

Most $q$-matroids are not representable
by: Degen, Sebastian, et al.
Published: (2024)

A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)

Separable overpartition classes and excludant sizes of an overpartition
by: Chen, Y. H., et al.
Published: (2025)

Coloring hypergraphs with excluded minors
by: Steiner, Raphael
Published: (2022)

Girth in $GF(q)$-representable matroids
by: Davies, James, et al.
Published: (2025)

A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)

Tree-width of a graph excluding an apex-forest or a wheel as a minor
by: Liu, Chun-Hung, et al.
Published: (2025)

Comparing Width Parameters on Graph Classes
by: Brettell, Nick, et al.
Published: (2023)

Monadic transductions and definable classes of matroids
by: Jowett, Susan, et al.
Published: (2024)

Minors of matroids represented by sparse random matrices over finite fields
by: Gao, Pu, et al.
Published: (2023)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Average plane-size in complex-representable matroids
by: Campbell, Rutger, et al.
Published: (2023)

Orthogonal matroids over tracts
by: Jin, Tong, et al.
Published: (2023)