English
Related papers

Related papers: The excluded minors for $k$-polymatroids with bina…

200 papers

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

Combinatorics · Mathematics 2025-12-18 Jonathan Boretsky , Zach Walsh

We prove that every paving matroid that is an excluded minor of interval positroids can be reduced to one of three fundamental families of excluded minors of interval positroids by relaxing dependent hyperplanes. Using this result, we…

Combinatorics · Mathematics 2023-12-07 Hyungju Park

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…

Combinatorics · Mathematics 2025-04-17 Nick Brettell

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

The class of $k$-nearly finitary matroids for some natural number $k$ is a subclass of the class of nearly finitary matroids. A natural question is whether this inclusion is proper. We answer this question affirmatively by constructing a…

Combinatorics · Mathematics 2024-12-12 Patrick Tam

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of…

Combinatorics · Mathematics 2017-03-03 Dillon Mayhew , Gordon Royle , Geoff Whittle

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

Combinatorics · Mathematics 2020-06-02 Rutger Campbell , Kevin Grace , James Oxley , Geoff Whittle

We show that each real-representable matroid is a minor of a complex-representable excluded minor for real-representability. More generally, for an infinite field $\mathbb{F}_1$ and a field extension $\mathbb{F}_2$, if…

Combinatorics · Mathematics 2019-11-14 Rutger Campbell , Jim Geelen

An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

A lattice path matroid is a transversal matroid for which some collection of incomparable intervals in some linear order on the ground set is a presentation. We characterize the minor-closed class of lattice path matroids by its excluded…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam

The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and contains both the class of lifted-graphic matroids and the class of frame matroids, each of which generalises the class of graphic…

Combinatorics · Mathematics 2022-05-26 Rong Chen

The prism graph is the dual of the complete graph on five vertices with an edge deleted, $K_5\backslash e$. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

We consider a finite-dimensional vector space $W\subset K^E$ over an arbitrary field $K$ and an arbitrary set $E$. We show that the set $C(W)\subset 2^E$ consisting of the minimal supports of $W$ are the circuits of a matroid on $E$. In…

We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their…

Combinatorics · Mathematics 2020-12-23 Vaidy Sivaraman , Daniel Slilaty

Let $EX[M_1\dots, M_k]$ denote the class of binary matroids with no minors isomorphic to $M_1, \dots, M_k$. In this paper we give a decomposition theorem for $EX[S_{10}, S_{10}^*]$, where $S_{10}$ is a certain 10-element rank-4 matroid. As…

Combinatorics · Mathematics 2014-05-21 Sandra Kingan

We determine sufficient conditions for certain classes of $(n+k) \times n$ matrices $E$ to have all order-$n$ minors to be nonzero. For a special class of $(n+1) \times n$ matrices $E,$ we give the formula for the order-$n$ minors. As an…

Functional Analysis · Mathematics 2020-08-12 Priyabrata Bag , Santanu Dey , Masaru Nagisa , Hiroyuki Osaka

One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…

Combinatorics · Mathematics 2020-08-11 George Drummond , Tara Fife , Kevin Grace , James Oxley

We show that almost every matroid contains the rank-3 whirl $\mathcal{W}^3$ or the complete-graphic matroid $M(K_4)$ as a minor.

Combinatorics · Mathematics 2021-11-24 Jorn van der Pol