Let T(M; x,y) = ∑ij Tij xiyjdenote the Tutte polynomial of the matroid M. If Tij is a corner of T (M; x, y), then Tij counts the sets of corank i and nullity j and each such set is a cyclic flat of M. The main result of this article consists of extending the definition of cyclic flats to a pair of matroids and proving that the corners of the linking polynomial give the lower bound of the number of the cyclic flats of the matroid pair
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Any set of points in a finite projective space PG(n,q) defines a matroid which is representable over...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
A at of a matroid is cyclic if it is a union of circuits. The cyclic ats of a matroid form a lattice...
AbstractThis paper characterizes, for each i and j, the matroids that are minor-minimal among connec...
Matorids provide useful abstraction in combinatorics and have a number of applications in many areas...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
We show that the 4-variable generating function of certain orientation related parameters of an orde...
There is a renewed interest in matroid perspectives, either for their relevance in other fields of c...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
This chapter summarizes the various attempts to extend the Tutte polynomial of a matroid to a polyno...
AbstractLet [Xi] be a saturated chain of flats in a rank-r simple matroid G and let ai be the number...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Any set of points in a finite projective space PG(n,q) defines a matroid which is representable over...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
A at of a matroid is cyclic if it is a union of circuits. The cyclic ats of a matroid form a lattice...
AbstractThis paper characterizes, for each i and j, the matroids that are minor-minimal among connec...
Matorids provide useful abstraction in combinatorics and have a number of applications in many areas...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
We show that the 4-variable generating function of certain orientation related parameters of an orde...
There is a renewed interest in matroid perspectives, either for their relevance in other fields of c...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
This chapter summarizes the various attempts to extend the Tutte polynomial of a matroid to a polyno...
AbstractLet [Xi] be a saturated chain of flats in a rank-r simple matroid G and let ai be the number...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
Any set of points in a finite projective space PG(n,q) defines a matroid which is representable over...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...