Jonas Keinholz

November 16, 2018

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This article defines the combinatorial structures known as Independence Systems and Matroids and provides basic concepts and theorems related to them. These structures play an important role in combinatorial optimisation, e. g. greedy algorithms such as Kruskal's algorithm. The development is based on Oxley's `What is a Matroid?'.


BSD License


Session Matroids