AbstractThe circuits containing some fixed element of a connected matroid (such a collection is called a port) provide a matroid generalization of the “path collections” of graphs. In this note we show how to translate forbidden minor theorems in matroid theory into results about ports — and we find that many theorems are strengthened by such translation. Those collections of sets which are “path collections” of graphs may then be characterized
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractFor all positive integers k, the class Bk of matroids of branch-width at most k is minor-clo...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
AbstractThe circuits containing some fixed element of a connected matroid (such a collection is call...
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...
Let ℱ be a collection of 3-connected matroids, none a proper minor of another, such that if M is a 3...
In this paper we consider a linking operation between matroids, defined as M-SP M-S= (M-SP V M-S) X...
This paper surveys recent work that is aimed at generalising the results and techniques of the Grap...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
AbstractBy a well-known result of Tutte, if e is an element of a connected matroid M, then either th...
This paper gives an informal introduction to structure theory for minor-closed classes of matroids r...
This paper gives an informal introduction to structure theory for minor- closed classes of matroids...
AbstractWe extend the notion of a minor from matroids to simplicial complexes. We show that the clas...
Abstract. For all positive integers k, the class Bk of matroids of branch-width at most k is minor-c...
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractFor all positive integers k, the class Bk of matroids of branch-width at most k is minor-clo...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
AbstractThe circuits containing some fixed element of a connected matroid (such a collection is call...
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...
Let ℱ be a collection of 3-connected matroids, none a proper minor of another, such that if M is a 3...
In this paper we consider a linking operation between matroids, defined as M-SP M-S= (M-SP V M-S) X...
This paper surveys recent work that is aimed at generalising the results and techniques of the Grap...
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Wu showed that w...
AbstractBy a well-known result of Tutte, if e is an element of a connected matroid M, then either th...
This paper gives an informal introduction to structure theory for minor-closed classes of matroids r...
This paper gives an informal introduction to structure theory for minor- closed classes of matroids...
AbstractWe extend the notion of a minor from matroids to simplicial complexes. We show that the clas...
Abstract. For all positive integers k, the class Bk of matroids of branch-width at most k is minor-c...
For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. Whe...
AbstractFor all positive integers k, the class Bk of matroids of branch-width at most k is minor-clo...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
DOI
Add to ORKG