In this article, the connections amid matroid and other notions have been studied. The structure of matroid could be a reflection of some other structure in lattice theory, group theory, other algebraic structure, graph theory, combinatorics and enumeration theory.

Let $\mathcal{N}$ be an arbitrary class of matroids, closed under isomorphism. For $k$ a positive integer, we say that $M \in \mathcal{N}$ is \emph{$k$-minor-irreducible} if $M$ has no minor $N \in \mathcal{N}$ such that $1\leq\left|E\left(M\right)\right|-\left|E\left(N\right)\right|\leq k $. Tutte's Wheels and Whirls Theorem establish that, up to isomorphism, there are only two families of 1-minor-irreducible matroids in the class of 3-connected matroids. More recently, Lemos classified the 3-minor-irreducibles with at least 14 elements in the class of triangle-free 3-connected matroids. Here we prove a local characterization for the 2-minor-irreducible matroids with at least 11 elements in the class of triangle-free 3-connected matroids. This local characterization is used to establish two new families of 2-minor-irreducible matroids in this class.

Linear-width is a well-regarded width parameter in graph theory. The constructs of linear loose tangle and linear tangle present obstacles to attaining linear-width. In this succinct paper, our primary focus will be the exploration of maximal linear loose tangles.