English
Related papers

Related papers: A Density Hales-Jewett Theorem for matroids

200 papers

We show that, if $k$ and $\ell$ are positive integers and $r$ is sufficiently large, then the number of rank-$k$ flats in a rank-$r$ matroid $M$ with no $U_{2,\ell+2}$-minor is less than or equal to number of rank-$k$ flats in a rank-$r$…

Combinatorics · Mathematics 2013-09-18 Peter Nelson

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

We show that, if $M$ is a simple rank-$n$ matroid with no $\ell$-point line minor and no minor isomorphic to the cycle matroid of a $t$-vertex complete graph, then the ratio $|M| / n$ is bounded above by a singly exponential function of…

Combinatorics · Mathematics 2023-06-28 Peter Nelson , Sergey Norin , Fernanda Rivera Omana

We show for each positive integer $a$ that, if $\mathcal{M}$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $c$ such that either every rank-$r$ matroid in $\mathcal{M}$ can…

Combinatorics · Mathematics 2013-06-04 Peter Nelson

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Combinatorics · Mathematics 2012-09-10 Jim Geelen , Peter Nelson

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 construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.

Combinatorics · Mathematics 2018-05-21 Adam Brown , Peter Nelson

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Peter Nelson

We show that, if $q$ is a prime power at most 5, then every rank-$r$ matroid with no $U_{2,q+2}$-minor has no more lines than a rank-$r$ projective geometry over GF$(q)$. We also give examples showing that for every other prime power this…

Combinatorics · Mathematics 2013-06-12 Jim Geelen , Peter Nelson

A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property…

Combinatorics · Mathematics 2014-01-29 Peter Nelson , Stefan H. M. van Zwam

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

Combinatorics · Mathematics 2011-05-23 Peter Nelson

A matroid is uniform if and only if it has no minor isomorphic to $U_{1,1}\oplus U_{0,1}$ and is paving if and only if it has no minor isomorphic to $U_{2,2}\oplus U_{0,1}$. This paper considers, more generally, when a matroid $M$ has no…

Combinatorics · Mathematics 2021-02-24 George Drummond

Let $\cM$ be a minor-closed class of matroids that does not contain arbitrarily long lines. The growth rate function, $h:\bN\rightarrow \bN$ of $\cM$ is given by $$h(n) = \max(|M|\, : \, M\in \cM, simple, rank-$n$).$$ The Growth Rate…

Combinatorics · Mathematics 2011-11-01 Jim Geelen , Peter Nelson

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

Combinatorics · Mathematics 2014-10-29 Jim Geelen , Peter Nelson

We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…

Combinatorics · Mathematics 2023-09-28 Jim Geelen , Matthew E. Kroeker

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Jim Geelen , Peter Nelson

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

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

Combinatorics · Mathematics 2014-02-25 Jim Geelen

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is…

Combinatorics · Mathematics 2021-11-10 Peter Nelson , Zach Walsh
‹ Prev 1 2 3 10 Next ›