Theorems · Theorem · combinatorics
SimpleGraph.Walk.map_toDeleteEdges_eq
∀ {V : Type u} {G : SimpleGraph V} {v w : V} (s : Set (Sym2 V)) {p : G.Walk v w} (hp : ∀ e ∈ p.edges, e ∉ s),
SimpleGraph.Walk.map (SimpleGraph.Hom.ofLE ⋯) (SimpleGraph.Walk.toDeleteEdges s p hp) = p- Cited by
- 0 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- Sym2statement and proof · cited by 737
- SimpleGraph.Walk.edgesstatement and proof · cited by 145
- SimpleGraph.Homstatement · cited by 139
- SimpleGraph.Walk.mapstatement · cited by 66
- SimpleGraph.deleteEdgesstatement · cited by 64
- SimpleGraph.Hom.ofLEstatement · cited by 27
- SimpleGraph.Walk.edges_subset_edgeSetproof · cited by 11
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.