This article studies the girth and cogirth problems for a connected matroid. The problem of finding the cogirth of a graphic matroid has been intensively studied, but studies on the equivalent problem for a vector matroid or a general matroid have been rarely reported. Based on the duality and connectivity of a matroid, we prove properties associated with the girth and cogirth of a matroid whos...

matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism group). We prove the fixing numbers for the cycle matroid and bicircular matroid associated with 3-connected graphs are identical. Many of these results have...

A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is modular. Poljak and Turzı́k proved that no rank-3 matroid having two disjoint lines is sticky. We show that, for r ≥ 3, no rank-r matroid having two disjoint hyperp...

We prove that three matroid optimisation problems, namely, the matchoid, matroid parity and matroid matching problems, all reduce to the b-matching problem when the matroids concerned are laminar. We then use this equivalence to show that laminar matroid parity polytopes are affinely congruent to b-matching polytopes, and have Chvátal rank equal to one. On the other hand, we prove that laminar ...

In this work, we consider matroid theory. After presenting three different (but equivalent) definitions of matroids, we mention some of the most important theorems of such theory. In particular, we note that every matroid has a dual matroid and that a matroid is regular if and only if it is binary and includes no Fano matroid or its dual. We show a connection between this last theorem and octon...

Las Vergnas [9] introduced several lattice structures on the bases of an ordered matroid M by using their external and internal activities. He also noted [10] that when computing the Möbius function of these lattices, it was often zero, although he had no explanation for that fact. The purpose of this paper is to provide a topological reason for this phenomenon. In particular, we show that the ...