ConceptMathematics
Graphic matroid
A matroid defined from a finite graph where a subset of edges is independent if it does not contain a circuit.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Philip Engel
A matroid constructed by taking the edges in the free abelian group generated by the edges and reducing modulo the homology of the graph.
Connections
7The lectures that define it or assume it, and the concepts next to it.