Matroids are rich combinatorial structures that can be seen as a general notion of independence. However, matroids are particular in that they have dozens of different cryptomorphic definitions. Therefore they appear underlying in many mathematical objects and applications can been found in several different fields including algebra, geometry, graph theory, model theory and optimization. In this talk we will briefly describe the main concepts of matroid theory as well as explaining how to abstract matroids from matrices and graphs.