DOIAbstract
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads to simple proofs of some basic and well-known facts about matroids, including a variety of axiomatizations
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads to simple proofs of some basic and well-known facts about matroids, including a variety of axiomatizations
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...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
In this paper we introduce a notation of a semimatroid and we try to justify this new concept, which...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractA matroid may be defined as a collection of sets, called bases, which satisfy a certain exch...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractI extend two theorems of Edmonds concerning common independent vectors in two polymatroids. ...
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...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
In this paper we introduce a notation of a semimatroid and we try to justify this new concept, which...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractA matroid may be defined as a collection of sets, called bases, which satisfy a certain exch...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractI extend two theorems of Edmonds concerning common independent vectors in two polymatroids. ...
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...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
Add to ORKG