6 research outputs found
The Characterization Of Graphs With Small Bicycle Spectrum
Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dual of a matroid design is a matroid with all circuits of the same size, called a dual matroid design. The connected bicircular dual matroid designs have been characterized previously. In addition, these results have been extended to connected bicircular matroids with circuits of two sizes in the case that the associated graph is a subdivision of a 3-connected graph. In this dissertation, we will use a graph theoretic approach to discuss the characterizations of bicircular matroids with circuits of two and three sizes. We will characterize the associated graph of a bicircular matroid with circuits of two sizes. Moreover, we will provide a characterization of connected bicircular matroids with circuits of three sizes in the case that the associated graph is a subdivision of a 3-connected graph. We will also investigate the circuit spectrum of bicircular matroids whose associated graphs have minimum degree at least i for k β₯ 1, and show that there exists a set of bicycles with consecutive bicycle lengths
On excluded minors of connectivity 2 for the class of frame matroids
We investigate the set of excluded minors of connectivity 2 for the class of
frame matroids. We exhibit a list of 18 such matroids, and show
that if is such an excluded minor, then either or
is a 2-sum of and a 3-connected non-binary frame matroid
The -invariant and catenary data of a matroid
The catenary data of a matroid of rank on elements is the vector
, indexed by compositions ,
where ,\, for , and , with the coordinate equal to the number of
maximal chains or flags of flats or closed sets such
that has rank ,\, , and . We show
that the catenary data of contains the same information about as its
-invariant, which was defined by H. Derksen [\emph{J.\ Algebr.\
Combin.}\ 30 (2009) 43--86]. The Tutte polynomial is a specialization of the
-invariant. We show that many known results for the Tutte
polynomial have analogs for the -invariant. In particular, we show
that for many matroid constructions, the -invariant of the
construction can be calculated from the -invariants of the
constituents and that the -invariant of a matroid can be
calculated from its size, the isomorphism class of the lattice of cyclic flats
with lattice elements labeled by the rank and size of the underlying set. We
also show that the number of flats and cyclic flats of a given rank and size
can be derived from the -invariant, that the
-invariant of is reconstructible from the deck of
-invariants of restrictions of to its copoints, and that,
apart from free extensions and coextensions, one can detect whether a matroid
is a free product from its -invariant.Comment: 25 page