Add to ORKGThis paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion minimal subsets of the family into the set of circuits of a matroid.Peer Reviewe
We present a general model for set systems to be independence families with respect to set families ...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
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 Gamma of a ...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
This paper deals with the question of completing a monotone increasing family of subsets of a finite...
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
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 ...
We give "if and only if " characterization of graphs with the fol-lowing property: given n...
AbstractA map on clutters (collections of incomparable sets of a given set) is a function defined fr...
We present a general model for set systems to be independence families with respect to set families ...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...
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 Gamma of a ...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
This paper deals with the question of completing a monotone increasing family of subsets of a finite...
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
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 ...
We give "if and only if " characterization of graphs with the fol-lowing property: given n...
AbstractA map on clutters (collections of incomparable sets of a given set) is a function defined fr...
We present a general model for set systems to be independence families with respect to set families ...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Matroids arise from the abstract notion of dependency. Matroids can be studied from different points...