Sign inSign in
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.
as Philip Engel defines itInstitute for Advanced Study
Watch it explained

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.

Cohomology1Dual matroid1Graph theory1Graphic matroid1Matroid1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.