Theorems · Theorem · combinatorics
SimpleGraph.Walk.length_map
∀ {V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (f : G →g G') {u v : V} (p : G.Walk u v),
(SimpleGraph.Walk.map f p).length = p.length- Cited by
- 8 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.lengthstatement and proof · cited by 212
- SimpleGraph.Homstatement and proof · cited by 139
- SimpleGraph.Walk.mapstatement and proof · cited by 66
Cited by8
Results whose statement or proof uses this declaration.
- SimpleGraph.IsContained.egirth_leproof · cited by 2
- SimpleGraph.egirth_antiproof · cited by 1
- SimpleGraph.edist_antiproof · cited by 1
- SimpleGraph.cycleGraph_isContained_iffproof · cited by 1
- SimpleGraph.edist_boxProdproof · cited by 0
- SimpleGraph.Walk.length_mapLeproof · cited by 0
- SimpleGraph.two_colorable_iff_forall_loop_evenproof · cited by 0
- SimpleGraph.Reachable.dist_antiproof · cited by 0