Related papers: Non-Separating Cocircuits and Graphicness in Matro…

In this note we introduce a sufficient condition for the Orlik-Solomon algebra associated to a matroid M to be l-adic and we prove that this condition is necessary when M is binary (in particular graphic). Moreover, this result cannot be…

It follows by Bixby's Lemma that if $e$ is an element of a $3$-connected matroid $M$, then either ${\rm co}(M\delete e)$, the cosimplification of $M\delete e$, or ${\rm si}(M/e)$, the simplification of $M/e$, is $3$-connected. A natural…

A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…

Given a 3-connected biased graph $\Omega$ with a balancing vertex, and with frame matroid $F(\Omega)$ nongraphic and 3-connected, we determine all biased graphs $\Omega'$ with $F(\Omega') = F(\Omega)$. As a consequence, we show that if $M$…

We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…

DeVos et al conjectured that if $M$ is a simple, regular matroid and $c$ is a colouring of the elements of $M$ with $r(M)+1$ colours, where each colour class has at least two elements, then $M$ contains a rainbow circuit of size at most…

A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, if there is one such graph, there will be many. Zaslavsky has shown that frame matroids are precisely those having a representation as a…

We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…

Let $M$ be a $3$-connected binary matroid; $M$ is called internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a…

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…

This is a revised version of our original paper (arXiv:1808.00489v2) incorporating the corrections published in a corrigendum (arXiv:1808.00489v3). Our main theorem as originally stated was missing the required assumption that matroids…

Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, {\em quasi-graphic matroids}, that unifies these two existing classes. Unlike frame matroids and…

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…

The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid equivalent to the isotropic system of $G$. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $\neq 2$. The…

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

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…

We consider structural equation models (SEMs), in which every variable is a function of a subset of the other variables and a stochastic error. Each such SEM is naturally associated with a directed graph describing the relationships between…

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

The isotropic matroid $M[IAS(G)]$ of a graph $G$ is a binary matroid, which is equivalent to the isotropic system introduced by Bouchet. In this paper we discuss four notions of connectivity related to isotropic matroids and isotropic…