Matroid

A **matroid** is a combinatorial structure that generalizes the notion of linear independence in vector spaces to more abstract settings. It is defined by a pair \((S, I)\), where: - \(S\) is a finite set of elements. - \(I\) is a collection of subsets of \(S\) (called independent sets) that satisfy certain properties.