Theorems · Inductive type · combinatorics
Quiver.Arborescence
(V : Type u) → [Quiver V] → Type (max u v)
A quiver is an arborescence when there is a unique path from the default vertex to every other vertex.
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Quiver
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiverstatement · cited by 405
Cited by21
Results whose statement or proof uses this declaration.
- IsFreeGroupoid.SpanningTree.homOfPathstatement and proof · cited by 4
- IsFreeGroupoid.SpanningTree.treeHomstatement and proof · cited by 4
- IsFreeGroupoid.SpanningTree.functorOfMonoidHomstatement and proof · cited by 3
- IsFreeGroupoid.SpanningTree.loopOfHomstatement and proof · cited by 3
- Quiver.rootstatement and proof · cited by 3
- IsFreeGroupoid.SpanningTree.treeHom_eqstatement and proof · cited by 2
- IsFreeGroupoid.SpanningTree.loopOfHom_eq_idstatement and proof · cited by 1
- IsFreeGroupoid.SpanningTree.treeHom_rootstatement and proof · cited by 1
- Quiver.Arborescence.casesOnstatement and proof · cited by 0
- Quiver.Arborescence.ctorIdxstatement and proof · cited by 0
- Quiver.Arborescence.noConfusionstatement and proof · cited by 0
- Quiver.Arborescence.noConfusionTypestatement and proof · cited by 0