can anybody please help me to prove bicircular matroid is a matroid, from the direct definition of bicircular graph, it is also called pseudoforest.
So we define the independent set to be the edge subset of $G = (V,E)$, and each connected component of $(V,X)$ for $X$ subset of E contains at most one cycle.
Anybody has some suggestions please? Thanks a lot.