3,055 research outputs found
Bicircular signed-graphic matroids
Several matroids can be defined on the edge set of a graph. Although
historically the cycle matroid has been the most studied, in recent times, the
bicircular matroid has cropped up in several places. A theorem of Matthews from
late 1970s gives a characterization of graphs whose bicircular matroids are
graphic. We give a characterization of graphs whose bicircular matroids are
signed-graphic.Comment: 8 page
The Lattice of Cyclic Flats of a Matroid
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats
of a matroid form a lattice under inclusion. We study these lattices and
explore matroids from the perspective of cyclic flats. In particular, we show
that every lattice is isomorphic to the lattice of cyclic flats of a matroid.
We give a necessary and sufficient condition for a lattice Z of sets and a
function r on Z to be the lattice of cyclic flats of a matroid and the
restriction of the corresponding rank function to Z. We define cyclic width and
show that this concept gives rise to minor-closed, dual-closed classes of
matroids, two of which contain only transversal matroids.Comment: 15 pages, 1 figure. The new version addresses earlier work by Julie
Sims that the authors learned of after submitting the first versio
Characteristic of partition-circuit matroid through approximation number
Rough set theory is a useful tool to deal with uncertain, granular and
incomplete knowledge in information systems. And it is based on equivalence
relations or partitions. Matroid theory is a structure that generalizes linear
independence in vector spaces, and has a variety of applications in many
fields. In this paper, we propose a new type of matroids, namely,
partition-circuit matroids, which are induced by partitions. Firstly, a
partition satisfies circuit axioms in matroid theory, then it can induce a
matroid which is called a partition-circuit matroid. A partition and an
equivalence relation on the same universe are one-to-one corresponding, then
some characteristics of partition-circuit matroids are studied through rough
sets. Secondly, similar to the upper approximation number which is proposed by
Wang and Zhu, we define the lower approximation number. Some characteristics of
partition-circuit matroids and the dual matroids of them are investigated
through the lower approximation number and the upper approximation number.Comment: 12 page
Matroids with nine elements
We describe the computation of a catalogue containing all matroids with up to
nine elements, and present some fundamental data arising from this cataogue.
Our computation confirms and extends the results obtained in the 1960s by
Blackburn, Crapo and Higgs. The matroids and associated data are stored in an
online database, and we give three short examples of the use of this database.Comment: 22 page
Covering matroid
In this paper, we propose a new type of matroids, namely covering matroids,
and investigate the connections with the second type of covering-based rough
sets and some existing special matroids. Firstly, as an extension of
partitions, coverings are more natural combinatorial objects and can sometimes
be more efficient to deal with problems in the real world. Through extending
partitions to coverings, we propose a new type of matroids called covering
matroids and prove them to be an extension of partition matroids. Secondly,
since some researchers have successfully applied partition matroids to
classical rough sets, we study the relationships between covering matroids and
covering-based rough sets which are an extension of classical rough sets.
Thirdly, in matroid theory, there are many special matroids, such as
transversal matroids, partition matroids, 2-circuit matroid and
partition-circuit matroids. The relationships among several special matroids
and covering matroids are studied.Comment: 15 page
- …