Related papers: A matroid extension result

Let $\mathcal{N}$ be a set of matroids. A matroid $M$ is strictly $\mathcal{N}$-fragile if $M$ has a member of $\mathcal{N}$ as minor and, for all $e \in E(M)$, at least one of $M\backslash e$ and $M/e$ has no minor in $\mathcal{N}$. In…

We define a matroid invariant called the three-cosystole that is related to higher notions of cogirth for weighted matroids, and we prove an optimal upper bound for it in the class of regular matroids of rank at most six. To accomplish…

In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…

We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $ D=(V,A) $ be a countable digraph with $ s\neq t\in V $ and let $\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v $ be a matroid on $ A $ where $…

For a matroid, we define a new simplicial complex whose facets are indexed by its independent sets. This complex contains the external activity complex as a subcomplex. We call our complex the augmented external activity complex since its…

We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…

This paper investigates the question of uniqueness of the reduced oriented matroid structure arising from root systems of a Coxeter group in real vector spaces. We settle the question for finite Coxeter groups, irreducible affine Weyl…

Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The $\Gamma$-extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and…

Let $M$ be a matroid. We study the expansions of $M$ mainly to see how the combinatorial properties of $M$ and its expansions are related to each other. It is shown that $M$ is a graphic, binary or a transversal matroid if and only if an…

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…

For all positive integers $t$ exceeding one, a matroid has the cyclic $(t-1,t)$-property if its ground set has a cyclic ordering $\sigma$ such that every set of $t-1$ consecutive elements in $\sigma$ is contained in a $t$-element circuit…

Given a matroid $M=(E,{\cal I})$, and a total ordering over the elements $E$, a broken circuit is a circuit where the smallest element is removed and an NBC independent set is an independent set in ${\cal I}$ with no broken circuit. The set…

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

In earlier work, we characterized the class of matroids with no $M(C_4)$ as an induced minor and the class of matroids with no member of $\{M(C_4),M(K_4)\}$ as an induced minor. In this paper, for every two matroids in…

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…

We provide a constructive characterisation of circuits in the simple (2,2)-sparsity matroid. A circuit is a simple graph G=(V,E) with |E|=2|V|-1 and the number of edges induced by any $X \subsetneq V$ is at most 2|X|-2. Insisting on…

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 conjectures that might be approachable using the…

Given a root system $\mathsf{R}$, the vector system $\tilde{\mathsf{R}}$ is obtained by taking a representative $v$ in each antipodal pair $\{v, -v\}$. The matroid $M(\mathsf{R})$ is formed by all independent subsets of…

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

In this paper, we define generalized splitting and element splitting operations on $p$-matroids. $p$-matroids are the matroids representable over $GF(p).$ The circuits and the bases of the new matroid are characterized in terms of circuits…