Theorems · Theorem · combinatorics

SimpleGraph.Walk.map_induce

∀ {V : Type u} {G : SimpleGraph V} {s : Set V} {u v : V} (w : G.Walk u v) (hw : ∀ x ∈ w.support, x ∈ s),
  SimpleGraph.Walk.map (SimpleGraph.Embedding.induce s).toHom (SimpleGraph.Walk.induce s w hw) = w

Defined in

Mathlib.Combinatorics.SimpleGraph.Walk.Maps

Cited by

0 results in Mathlib

Foundations

Depth 17 from the axioms · uses propext, Quot.sound