AbstractGiven a finite subset E of a vector space of dimension 4, the number of k-independent subsets of E will be denoted by Ik. We prove that kIk2 ≥ (k + 1)Ik − 1Ik + 1 + Ik − 1Ik. The equality holds if and only if all 4-subsets of E are independent. We prove this relation for matroids of rank 4. In particular we prove Mason's conjecture on the independence numbers of a matroid for k=3
AbstractLet G be a graph without induced K1,3. The number of independent k-subsets of V(G) will be d...
AbstractLet f(n) denote the number of non-isomorphic matroids on an n-element set. In 1969, Welsh co...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...
AbstractWe determine the minimum number of independent sets of arbitrary fixed rank contained in a m...
AbstractA set X in a vector space V is said to be k-independent (where k is a positive integer) if, ...
AbstractA short proof is given of a recent theorem of M. Feinberg on representable matroids. The res...
AbstractWe characterize the matroid dual to a transversal matroid. We also show that Richard Rado's ...
AbstractAn upper bound for the number of matroids is obtained. This upper bound complements the lowe...
AbstractWe consider a class of matroids which we call ordered matroids. We show that these are the m...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135388/1/jlms0251.pd
AbstractLet M1 and M2 be two matroids on the same ground set S. We conjecture that if there do not e...
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...
AbstractMotivated by the rank-axiomatic definitions of a matroid and Woodall's characterization of i...
AbstractA subset of the vertices of a graph is independent if no two vertices in the subset are adja...
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
AbstractLet G be a graph without induced K1,3. The number of independent k-subsets of V(G) will be d...
AbstractLet f(n) denote the number of non-isomorphic matroids on an n-element set. In 1969, Welsh co...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...
AbstractWe determine the minimum number of independent sets of arbitrary fixed rank contained in a m...
AbstractA set X in a vector space V is said to be k-independent (where k is a positive integer) if, ...
AbstractA short proof is given of a recent theorem of M. Feinberg on representable matroids. The res...
AbstractWe characterize the matroid dual to a transversal matroid. We also show that Richard Rado's ...
AbstractAn upper bound for the number of matroids is obtained. This upper bound complements the lowe...
AbstractWe consider a class of matroids which we call ordered matroids. We show that these are the m...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135388/1/jlms0251.pd
AbstractLet M1 and M2 be two matroids on the same ground set S. We conjecture that if there do not e...
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...
AbstractMotivated by the rank-axiomatic definitions of a matroid and Woodall's characterization of i...
AbstractA subset of the vertices of a graph is independent if no two vertices in the subset are adja...
AbstractLet G=(V, E) be a graph and let L(G) be the set of stable sets of G. The matroidal number of...
AbstractLet G be a graph without induced K1,3. The number of independent k-subsets of V(G) will be d...
AbstractLet f(n) denote the number of non-isomorphic matroids on an n-element set. In 1969, Welsh co...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...