Templates for Binary Matroids

  title={Templates for Binary Matroids},
  author={Kevin Grace and Stefan H. M. van Zwam},
  journal={SIAM J. Discret. Math.},
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial templates that are minimal with respect to this order. As an application of our main result, we determine the eventual growth rates of certain minor-closed classes of binary matroids, including the class of binary matroids with no minor isomorphic to PG(3,2… 

Figures and Topics from this paper

The templates for some classes of quaternary matroids
  • Kevin Grace
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. B
  • 2021
Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, the highly connected members of the class of golden-mean matroids are completely characterized and this leads to a determination of the eventual extremal functions for these classes.
On The Density of Binary Matroids Without
This thesis is motivated by the following question: how many elements can a simple binary matroid with no PG(t, 2)-minor have? This is a natural analogue of questions asked about the density of
  • 2019
Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the class of golden-mean matroids and several
On Perturbations of Highly Connected Dyadic Matroids
AbstractGeelen, Gerards, and Whittle [3] announced the following result: let $${q = p^k}$$q=pk be a prime power, and let $${\mathcal{M}}$$M be a proper minor-closed class of GF(q)-representable
The extremal function for geometry minors of matroids over prime fields
For each projective or affine geometry $N$ over a prime field $\mathbb{F}$, we give a best-possible upper bound on number of elements in a simple $\mathbb{F}$-representable matroid $M$ of
The Highly Connected Even-Cycle and Even-Cut Matroids
It is shown that the number of excluded minors for these classes can be drastically reduced if in each class only the highly connected matroids of sufficient size are considered.
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids
Subject to announced results by Geelen, Gerards, and Whittle, the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unity matroids are characterized.


Matroids and Multicommodity Flows
  • P. Seymour
  • Computer Science, Mathematics
    Eur. J. Comb.
  • 1981
The max-flow min-cut theorem and the two-commodity flow theorem may both be interpreted as equalities between the maximum feasible packing of certain circuits of a graph and the minimum capacity of
Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic
It is proved that the maximum size of a simple binary matroid of rank 5 with no $AG(3,2)$-minor is $\binom{r+1}{2}$ and those matroids achieving this bound are characterized.
Growth rates of minor-closed classes of matroids
It is proved that, if M does not contain all simple rank-2 matroids, then h(k) is finite and is either linear, quadratic, or exponential.
Matroids denser than a clique
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
The Highly Connected Matroids in Minor-Closed Classes
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of
Projective geometries in dense matroids
We prove that, given integers l,q>=2 and n there exists an integer @a such that, if M is a simple matroid with no l+2 point line minor and at least @aq^r^(^M^) elements, then M contains a
Graph Minors. XVI. Excluding a non-planar graph
It is found that every graph with no minor isomorphic to L may be constructed by piecing together in a tree-structure graphs each of which "almost" embeds in some surface in which L cannot be embedded.
Cliques in dense GF(q)-representable matroids
We prove that, for any finite field F and positive integer n, there exists an integer λ such that if M is a simple F-representable matroid with no M(Kn)-minor, then |E(M)|≥λr(M).
Seymour’s 1-flowing Conjecture III, The Matroid Union, WordPress
  • Mar. 2015, Web,
  • 2016
Matroid Theory, Second Edition
  • 2011