Topics
matroidBuilding
In a loopless matroid a non-empty set is connected in the sense of Hartfiel and Maxson if and only if it spans a non-separable flat. © 1980
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
AbstractFor a 3-connected binary matroid M, let dimA(M) be the dimension of the subspace of the cocy...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
AbstractIn a loopless matroid a non-empty set is connected in the sense of Hartfiel and Maxson if an...
AbstractIn this note a definition of connected sets of a matroid is given. Several natural results c...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
Let n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this paper, ...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractIn this paper, we prove that any simple and cosimple connected binary matroid has at least f...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
In this note we determine when a collection of subsets of a set E is the set of non-spanning circuit...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
Matroids were introduced in 1935 by Hassler Whitney to provide a way to abstractly capture the depen...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
AbstractFor a 3-connected binary matroid M, let dimA(M) be the dimension of the subspace of the cocy...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
AbstractIn a loopless matroid a non-empty set is connected in the sense of Hartfiel and Maxson if an...
AbstractIn this note a definition of connected sets of a matroid is given. Several natural results c...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
Let n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this paper, ...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractIn this paper, we prove that any simple and cosimple connected binary matroid has at least f...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
In this note we determine when a collection of subsets of a set E is the set of non-spanning circuit...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
Matroids were introduced in 1935 by Hassler Whitney to provide a way to abstractly capture the depen...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
AbstractFor a 3-connected binary matroid M, let dimA(M) be the dimension of the subspace of the cocy...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
Add to ORKG