SimpleGraph.IsCycles.reachable_deleteEdges

∀ {V : Type u_1} {G : SimpleGraph V} {v w : V} [Finite V],
  G.Adj v w → G.IsCycles → (G.deleteEdges {s(v, w)}).Reachable v w

Defined in: Mathlib.Combinatorics.SimpleGraph.Matching
Cited by: 1 results in Mathlib
Foundations: Depth 106 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Finite

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.