Add to ORKGIt is well known that a matroid L is a lift of a matroid M if and only if every circuit of L is the union of some circuits of M. In this paper we give a simpler proof of this important theorem. We also described a discrete homotopy theorem on two matroids of different ranks on the same ground set.Comment: 7 page
From an integer-valued function f we obtain, in a natural way, a matroid Mf on the domain of f. We s...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractIn this note, we construct all the matroids that have a pair of elements belonging to just o...
AbstractIf M is a matroid on a set S and if X is a subset of S, then there are two matroids on X ind...
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
AbstractA matroidal family C is defined to be a collection of graphs such that, for any given graph ...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
From an integer-valued function f we obtain, in a natural way, a matroid Mf on the domain of f. We s...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...
AbstractLet B(M) denote the collection of bases of a matroid M. Truemper showed that if M1 and M2 ar...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
AbstractIn this note, we construct all the matroids that have a pair of elements belonging to just o...
AbstractIf M is a matroid on a set S and if X is a subset of S, then there are two matroids on X ind...
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
AbstractA matroidal family C is defined to be a collection of graphs such that, for any given graph ...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
Quirk and Seymour have shown that a connected simple graph has at least as many spanning trees as ci...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
AbstractWe introduce a new axiomatization of matroid theory that requires the elimination property o...
From an integer-valued function f we obtain, in a natural way, a matroid Mf on the domain of f. We s...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
AbstractIt is proved that, if M is a binary matroid, then every cocircuit of M has even cardinality ...