ConceptMathematics
Cographic matroid
A matroid formed by taking edge loops as elements of the first cohomology of an oriented graph with integer coefficients indexed by the edges.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.