Abstract

A matroid is a structure that generalizes the properties of independence. Interesting applications are found in graph theory. This paper will focus on the definitions of a matroid in terms of bases, the rank function, independent sets and cycles.