Theorems · Theorem · combinatorics
SimpleGraph.Walk.edges_transfer
∀ {V : Type u} {G : SimpleGraph V} {u v : V} (p : G.Walk u v) {H : SimpleGraph V} (hp : ∀ e ∈ p.edges, e ∈ H.edgeSet),
(p.transfer H hp).edges = p.edges- Cited by
- 5 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Walkstatement and proof · cited by 915
- Sym2statement and proof · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.edgeSetstatement and proof · cited by 199
- SimpleGraph.Walk.edgesstatement and proof · cited by 145
- SimpleGraph.Walk.transferstatement and proof · cited by 16
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsCycle.transferproof · cited by 3
- SimpleGraph.Walk.transfer_transferstatement and proof · cited by 1
- SimpleGraph.IsBridge.sup_edge_of_not_reachable_of_isBridgeproof · cited by 1
- SimpleGraph.Walk.edgeSet_transferproof · cited by 0
- SimpleGraph.Walk.map_toDeleteEdges_eqproof · cited by 0