Sign inSign in
ConceptMathematics

Graphic matroid

A matroid defined from a finite graph where a subset of edges is independent if it does not contain a circuit.
as June Huh 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.

Graph theory2Abelian group1Circuit1Homology1Matroid1Matroid theory1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Philip Engel

    Institute for Advanced Study · Research

    A matroid constructed by taking the edges in the free abelian group generated by the edges and reducing modulo the homology of the graph.
    • 4:50Matroids and the Integral Hodge Conjecture for Abelian Varieties

Connections

7

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

2 lecturers. 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.