In this paper we introduce a notation of a semimatroid and we try to justify this new concept, which, in a way, is a generalization of the concept of a matroid
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
AbstractThe composition of a quotient matroid Q over a collection of component matroids f1, …, fn in...
In this note we determine when a collection of subsets of a set E is the set of non-spanning circuit...
In this paper we introduce a notation of a semimatroid and we try to justify this new concept, which...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractWe introduce a way to associate a family of circuits to an arbitrary clutter, suggested by a...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
AbstractA map on clutters (collections of incomparable sets of a given set) is a function defined fr...
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
A theorem of Birkhoff which states that there is a bijection between the class of all geometric latt...
A clutter is k-monotone, completely monotone or threshold if the corresponding Boolean function is k...
Matroids with coefficients, recently introduced by Dress [4], generalize ordinary matroids, Tutte re...
This paper deals with the question of completing a monotone increasing family of subsets to obtain t...
This paper deals with the question of completing a monotone increasing family of subsets to obtain t...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
AbstractThe composition of a quotient matroid Q over a collection of component matroids f1, …, fn in...
In this note we determine when a collection of subsets of a set E is the set of non-spanning circuit...
In this paper we introduce a notation of a semimatroid and we try to justify this new concept, which...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractWe introduce a way to associate a family of circuits to an arbitrary clutter, suggested by a...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
AbstractA map on clutters (collections of incomparable sets of a given set) is a function defined fr...
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
A theorem of Birkhoff which states that there is a bijection between the class of all geometric latt...
A clutter is k-monotone, completely monotone or threshold if the corresponding Boolean function is k...
Matroids with coefficients, recently introduced by Dress [4], generalize ordinary matroids, Tutte re...
This paper deals with the question of completing a monotone increasing family of subsets to obtain t...
This paper deals with the question of completing a monotone increasing family of subsets to obtain t...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
AbstractRepresentations of matroids in semimodular lattices and Coxeter matroids in chamber systems ...
AbstractThe composition of a quotient matroid Q over a collection of component matroids f1, …, fn in...
In this note we determine when a collection of subsets of a set E is the set of non-spanning circuit...
DOI
Add to ORKG