AbstractWe extend the notion of a minor from matroids to simplicial complexes. We show that the class of matroids, as well as the class of independence complexes, is characterized by a single forbidden minor. Inspired by a recent result of Aharoni and Berger, we investigate possible ways to extend the matroid intersection theorem to simplicial complexes
Matroids capture an abstract notion of independence that generalizes linear independence in linear a...
AbstractThe circuits containing some fixed element of a connected matroid (such a collection is call...
In this paper, it is shown that, for a minor-closed class ℳ of matroids, the class of matroids in wh...
AbstractWe extend the notion of a minor from matroids to simplicial complexes. We show that the clas...
AbstractIn this paper, it is shown that, for a minor-closed class M of matroids, the class of matroi...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
AbstractIt is easily proved that, if P is a class of graphs that is closed under induced subgraphs, ...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...
Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the s...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
This paper gives an informal introduction to structure theory for minor-closed classes of matroids r...
Let ℱ be a collection of 3-connected matroids, none a proper minor of another, such that if M is a 3...
This paper gives an informal introduction to structure theory for minor- closed classes of matroids...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
In this paper we consider a linking operation between matroids, defined as M-SP M-S= (M-SP V M-S) X...
Matroids capture an abstract notion of independence that generalizes linear independence in linear a...
AbstractThe circuits containing some fixed element of a connected matroid (such a collection is call...
In this paper, it is shown that, for a minor-closed class ℳ of matroids, the class of matroids in wh...
AbstractWe extend the notion of a minor from matroids to simplicial complexes. We show that the clas...
AbstractIn this paper, it is shown that, for a minor-closed class M of matroids, the class of matroi...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
AbstractIt is easily proved that, if P is a class of graphs that is closed under induced subgraphs, ...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...
Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the s...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
This paper gives an informal introduction to structure theory for minor-closed classes of matroids r...
Let ℱ be a collection of 3-connected matroids, none a proper minor of another, such that if M is a 3...
This paper gives an informal introduction to structure theory for minor- closed classes of matroids...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
In this paper we consider a linking operation between matroids, defined as M-SP M-S= (M-SP V M-S) X...
Matroids capture an abstract notion of independence that generalizes linear independence in linear a...
AbstractThe circuits containing some fixed element of a connected matroid (such a collection is call...
In this paper, it is shown that, for a minor-closed class ℳ of matroids, the class of matroids in wh...
DOI
Add to ORKG