AbstractIn this paper, we shall present an algorithm to decide when a connected matroid M is reconstructible from its connectivity function. When M is not reconstructible, this algorithm gives all the matroids with the same connectivity function as M
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
Matroids were introduced by Whitney to provide an abstract notion of independence. In this work, aft...
AbstractIn this paper, we shall present an algorithm to decide when a connected matroid M is reconst...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
AbstractIn this paper, we shall consider the following problem: up to duality, is a connected matroi...
Cunningham, and independently Lovasz and Recski, conjectured that a connected binary matroid M can b...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
Matroids were introduced in 1935 by Hassler Whitney to provide a way to abstractly capture the depen...
Certain classes of 2- and 3-connected matroids are studied in this thesis. In Chapter 2 we give a ch...
For a matroid N, a matroid M is N-connected if every two elements of M are in an N-minor together. T...
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)...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
Matroids were introduced by Whitney to provide an abstract notion of independence. In this work, aft...
AbstractIn this paper, we shall present an algorithm to decide when a connected matroid M is reconst...
AbstractThe connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E − X) −...
AbstractIn this paper, we shall consider the following problem: up to duality, is a connected matroi...
Cunningham, and independently Lovasz and Recski, conjectured that a connected binary matroid M can b...
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one eas...
AbstractIf M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then...
Matroids were introduced in 1935 by Hassler Whitney to provide a way to abstractly capture the depen...
Certain classes of 2- and 3-connected matroids are studied in this thesis. In Chapter 2 we give a ch...
For a matroid N, a matroid M is N-connected if every two elements of M are in an N-minor together. T...
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)...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
AbstractLet n be an integer exceeding one and M be a matroid having at least n + 2 elements. In this...
Matroids were introduced by Whitney to provide an abstract notion of independence. In this work, aft...
DOI
Add to ORKG