English
Related papers

Related papers: Minors of matroids represented by sparse random ma…

200 papers

Let ${\bf A}={\bf A}_{n,m,k}$ be a random $n\times m$ matrix over $\mathbf{GF}_2$ wher each column consists of $k$ randomly chosen ones. Let $M$ be an arbirary fixed binary matroid. We show that if $m/n$ and $k$ are sufficiently large then…

Combinatorics · Mathematics 2019-03-13 Colin Cooper , Alan Frieze , Wesley Pegden

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

Combinatorics · Mathematics 2012-12-18 Nathan Bowler , Johannes Carmesin

We prove that for each prime power $q$ there is an integer $n$ such that if $M$ is a $3$-connected, representable matroid with a PG$(n-1,q)$-minor and no $U_{2,q^2+1}$-minor, then $M$ is representable over GF$(q)$. We also show that for…

Combinatorics · Mathematics 2015-03-31 Jim Geelen , Rohan Kapadia

Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb P$, and let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary. We prove that either $M$ is bounded…

Combinatorics · Mathematics 2021-02-04 Nick Brettell , Ben Clark , James Oxley , Charles Semple , Geoff Whittle

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…

Combinatorics · Mathematics 2011-08-02 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

Let $M$ be a representable matroid on $n$ elements. We give bounds, in terms of $n$, on the least positive characteristic and smallest field over which $M$ is representable.

Combinatorics · Mathematics 2019-10-28 Jason Bell , Daryl Funk , Byoung Du Kim , Dillon Mayhew

Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb{P}$, let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary, and suppose $M$ has a pair of elements…

Combinatorics · Mathematics 2023-09-07 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

We study the evolution of random matroids represented by the sequence of random matrices over ${\mathbb F}_q$ where columns are added one after the other, and each column vector is a uniformly random vector in ${\mathbb F}_q^n$, independent…

Combinatorics · Mathematics 2024-04-29 Pu Gao , Jacob Mausberg , Peter Nelson

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

In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {\em triangles}, for a matroid to have either $U_{2,4}$ or $F_7$ or $M(K_5)$ as a minor.

Combinatorics · Mathematics 2014-12-17 Boris Albar , Daniel Gonçalves , Jorge L. Ramírez Alfonsín

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum

In 1984, Kelly and Oxley introduced the model of a random representable matroid $M[A_n]$ corresponding to a random matrix $A_n \in \mathbb{F}_q^{m(n) \times n}$, whose entries are drawn independently and uniformly from $\mathbb{F}_q$.…

Combinatorics · Mathematics 2021-11-16 Jason Altschuler , Elizabeth Yang

A matroid of rank $r$ on $n$ elements is a positroid if it has a representation by an $r$ by $n$ matrix over $\mathbb{R}$, each $r$ by $r$ submatrix of which has nonnegative determinant. Earlier characterizations of connected positroids and…

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

In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which…

Combinatorics · Mathematics 2025-07-15 Matthew Mizell , James Oxley

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

Combinatorics · Mathematics 2011-05-23 Jim Geelen , Peter Nelson

We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field $GF(q)$ and any integer $t$, every cosimple $GF(q)$-representable matroid with sufficiently large girth contains either $M(K_t)$ or $M(K_t)^*$ as a minor.

Combinatorics · Mathematics 2025-05-01 James Davies , Meike Hatzel , Kolja Knauer , Rose McCarty , Torsten Ueckerdt

We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…

Combinatorics · Mathematics 2026-03-11 Koji Imamura , Keisuke Shiromoto

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a k-element subset X of E(M) such that one of M\X…

Combinatorics · Mathematics 2014-12-12 Jim Geelen , Stefan H. M. van Zwam

A matroid $N$ is said to be triangle-rounded in a class of matroids $\mathcal{M}$ if each $3$-connected matroid $M\in \mathcal{M}$ with a triangle $T$ and an $N$-minor has an $N$-minor with $T$ as triangle. Reid gave a result useful to…

Combinatorics · Mathematics 2021-01-14 João Paulo Costalonga , Xianqiang Zhou
‹ Prev 1 2 3 10 Next ›