AbstractBased only on the knowledge of the values of the rank function two procedures are given to compute the rank partition of a matroid. It is also shown that one of these procedures enables one to determine the flag transversal of a matroid also
Matroid theory arose as an attempt to generalize and unify concepts in such relatively distinct are...
AbstractLet S be a nonempty finite set with cardinality m. Let M be a matroid on S with no loops. Th...
AbstractA simple way of associating a matroid of prescribed rank with a graph is shown. The matroids...
AbstractWe show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases ...
AbstractA matroid M over a set E of elements is semiseparated by a partition {S1, S2} of E iff rank ...
AbstractIn this paper, we study flag structures of matroid base polytopes. We describe faces of matr...
AbstractWe introduce the concept of depth and r-depth of a matroid M, proving that the sequence of t...
AbstractA matroid on the ground set N with the rank function r is said to be partition representable...
AbstractKishi and Kajitani introduced the concepts of the principal partition of a graph and maximal...
We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a mini...
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a gener...
In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base...
AbstractAn algorithm is presented for determining whether or not a matroid is a transversal matroid....
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
International audienceHypergraphics matroids were studied first by Lorea [18] and later by Frank et ...
Matroid theory arose as an attempt to generalize and unify concepts in such relatively distinct are...
AbstractLet S be a nonempty finite set with cardinality m. Let M be a matroid on S with no loops. Th...
AbstractA simple way of associating a matroid of prescribed rank with a graph is shown. The matroids...
AbstractWe show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases ...
AbstractA matroid M over a set E of elements is semiseparated by a partition {S1, S2} of E iff rank ...
AbstractIn this paper, we study flag structures of matroid base polytopes. We describe faces of matr...
AbstractWe introduce the concept of depth and r-depth of a matroid M, proving that the sequence of t...
AbstractA matroid on the ground set N with the rank function r is said to be partition representable...
AbstractKishi and Kajitani introduced the concepts of the principal partition of a graph and maximal...
We consider the rank reduction problem for matroids: Given a matroid M and an integer k, find a mini...
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a gener...
In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base...
AbstractAn algorithm is presented for determining whether or not a matroid is a transversal matroid....
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
International audienceHypergraphics matroids were studied first by Lorea [18] and later by Frank et ...
Matroid theory arose as an attempt to generalize and unify concepts in such relatively distinct are...
AbstractLet S be a nonempty finite set with cardinality m. Let M be a matroid on S with no loops. Th...
AbstractA simple way of associating a matroid of prescribed rank with a graph is shown. The matroids...
DOI
Add to ORKG