AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered set P determine a matroid Gk(P). This matroid is a gammoid. The identity on P induces a strong map from Gk(P) to Gk + 1(P). This strong map has a linear representation
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
AbstractWe show that under some assumptions the sets of sequences of block sizes of some partitions ...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractThe theorem of Greene and Kleitman concerning the existence of k-saturated partitions for an...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
AbstractA partial fieldPis an algebraic structure that behaves very much like a field except that ad...
Let M be a matroid representable over GF(q) and S be a subset of its ground set. In this note we pro...
AbstractThe two main results of this paper identify the “strict gammoids” of Mason [7] with duals of...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
AbstractWe show that under some assumptions the sets of sequences of block sizes of some partitions ...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractThe theorem of Greene and Kleitman concerning the existence of k-saturated partitions for an...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
AbstractA partial fieldPis an algebraic structure that behaves very much like a field except that ad...
Let M be a matroid representable over GF(q) and S be a subset of its ground set. In this note we pro...
AbstractThe two main results of this paper identify the “strict gammoids” of Mason [7] with duals of...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
Matroid theory is the study of abstract properties of linear dependence. A matroid consists of a fin...
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to...
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
AbstractWe show that under some assumptions the sets of sequences of block sizes of some partitions ...
Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chor...
DOI
Add to ORKG