ConceptMathematics
Absorbing lemma
A lemma stating that if a hypergraph has a sufficiently high codegree, it contains a path that can absorb any small even set of vertices.
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.
Codegree1Hypergraph paths1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.