AbstractWe determine the minimum number of independent sets of arbitrary fixed rank contained in a matroid M as M varies over all simple (respectively loopless) matroids of fixed rank and cardinality
AbstractWe prove that, for any positive integers n, k and q, there exists an integer R such that, if...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractLet Rd(G) be the d-dimensional rigidity matroid for a graph G=(V,E). For X⊆V let i(X) be the...
AbstractWe determine the minimum number of independent sets of arbitrary fixed rank contained in a m...
AbstractGiven a finite subset E of a vector space of dimension 4, the number of k-independent subset...
AbstractAn upper bound for the number of matroids is obtained. This upper bound complements the lowe...
AbstractA short proof is given of a recent theorem of M. Feinberg on representable matroids. The res...
Let G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of G, deno...
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135388/1/jlms0251.pd
Given a matroid M = (E,I), and a total ordering over the elements E, a broken circuit is a circuit w...
AbstractWe characterize the matroid dual to a transversal matroid. We also show that Richard Rado's ...
For a matroid M having m rank-one flats, the density d(M) isr(M)m unless m = 0, in which case d(M) =...
AbstractLet M be a matroid on set E, ∣E∣ = m, with rank function r. For a positive integer w, M is s...
AbstractWe introduce a noncommutative binary operation on matroids, called free product. We show tha...
AbstractWe prove that, for any positive integers n, k and q, there exists an integer R such that, if...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractLet Rd(G) be the d-dimensional rigidity matroid for a graph G=(V,E). For X⊆V let i(X) be the...
AbstractWe determine the minimum number of independent sets of arbitrary fixed rank contained in a m...
AbstractGiven a finite subset E of a vector space of dimension 4, the number of k-independent subset...
AbstractAn upper bound for the number of matroids is obtained. This upper bound complements the lowe...
AbstractA short proof is given of a recent theorem of M. Feinberg on representable matroids. The res...
Let G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of G, deno...
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135388/1/jlms0251.pd
Given a matroid M = (E,I), and a total ordering over the elements E, a broken circuit is a circuit w...
AbstractWe characterize the matroid dual to a transversal matroid. We also show that Richard Rado's ...
For a matroid M having m rank-one flats, the density d(M) isr(M)m unless m = 0, in which case d(M) =...
AbstractLet M be a matroid on set E, ∣E∣ = m, with rank function r. For a positive integer w, M is s...
AbstractWe introduce a noncommutative binary operation on matroids, called free product. We show tha...
AbstractWe prove that, for any positive integers n, k and q, there exists an integer R such that, if...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractLet Rd(G) be the d-dimensional rigidity matroid for a graph G=(V,E). For X⊆V let i(X) be the...
DOI
Add to ORKG