Theorems · Theorem · combinatorics

SimpleGraph.Walk.IsCycle.toDeleteEdges

∀ {V : Type u} (G : SimpleGraph V) {v : V} (s : Set (Sym2 V)) {p : G.Walk v v},
  p.IsCycle → ∀ (hp : ∀ e ∈ p.edges, e ∉ s), (SimpleGraph.Walk.toDeleteEdges s p hp).IsCycle

Defined in

Mathlib.Combinatorics.SimpleGraph.Paths

Cited by

0 results in Mathlib

Foundations

Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound