Theorems · Theorem · combinatorics

SimpleGraph.Walk.reverse_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).reverse = SimpleGraph.Walk.map f p.reverse

Defined in

Mathlib.Combinatorics.SimpleGraph.Walk.Maps

Cited by

1 results in Mathlib

Foundations

Depth 10 from the axioms · uses propext