Theorems · Theorem · combinatorics
SimpleGraph.deleteEdges_adj
∀ {V : Type u_1} {v w : V} {G : SimpleGraph V} {s : Set (Sym2 V)}, (G.deleteEdges s).Adj v w ↔ G.Adj v w ∧ s(v, w) ∉ s- Cited by
- 4 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Sym2statement and proof · cited by 737
- Iff.notproof · cited by 489
- Sym2.mkstatement · cited by 332
- SimpleGraph.deleteEdgesstatement · cited by 64
- SimpleGraph.Adj.neproof · cited by 39
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.isBridge_iff_not_isEdgeReachable_twoproof · cited by 2
- SimpleGraph.exists_adj_isEdgeReachable_twoproof · cited by 1
- SimpleGraph.deleteIncidenceSet_adjproof · cited by 0
- SimpleGraph.Walk.toDeleteEdges_consstatement · cited by 0