Let $M = (E, \mathcal{F})$ be a matroid on a set $E$ and $B$ one of its bases. A closed set $\theta \subseteq E$ is saturated with respect to $B$ when $|\theta \cap B | \leq r(\theta)$, where $r(\theta)$ is the rank of $\theta$. The collection of subsets $I$ of $E$ such that $| I \cap \theta| \leq r(\theta)$ for every closed saturated set $\theta$ turns out to be the family of independent sets of a new matroid on $E$, called base-matroid and denoted by $M_B$. In this paper we prove that a graphic matroid $M$, isomorphic to a cycle matroid $M(G)$, is isomorphic to $M_B$, for every base $B$ of $M$, if and only if $M$ is direct sum of uniform graphic matroids or, in equivalent way, if and only if $G$ is disjoint union of cacti. Moreover we characterize simple binary matroids $M$ isomorphic to $M_B$, with respect to an assigned base $B$.
[1]
Mao-cheng Cai.
Inverse Problems of Matroid Intersection
,
1999,
J. Comb. Optim..
[2]
Cai Mao-cheng,et al.
Inverse Problems of Matroid Intersection
,
1999
.
[3]
D. R. Fulkerson,et al.
Transversals and Matroid Partition
,
1965
.
[4]
Mauro Dell'Amico,et al.
The Base-matroid and Inverse Combinatorial Optimization Problems
,
2003,
Discret. Appl. Math..
[5]
Clemens Heuberger,et al.
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
,
2004,
J. Comb. Optim..
[6]
Sulamita Klein,et al.
How is a chordal graph like a supersolvable binary matroid?
,
2004,
Discret. Math..