Theorems · Theorem · combinatorics
SimpleGraph.TopEdgeLabeling.labelGraph_toTopEdgeLabeling
∀ {V : Type u_1} [inst : DecidableEq V] (C : SimpleGraph.TopEdgeLabeling V (Fin 2)),
(SimpleGraph.EdgeLabeling.labelGraph C 1).toTopEdgeLabeling = C- Cited by
- 0 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- SimpleGraphstatement · cited by 3,072
- SimpleGraph.EdgeLabeling.labelGraphstatement · cited by 9
- SimpleGraph.toTopEdgeLabelingstatement · cited by 5
- SimpleGraph.TopEdgeLabelingstatement and proof · cited by 3
- SimpleGraph.EdgeLabeling.ext_getproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.