Theorems · Theorem · combinatorics
SimpleGraph.disjoint_sdiff_neighborFinset_image
∀ {V : Type u_1} (G : SimpleGraph V) {s t : V} [inst : DecidableEq V] [inst_1 : Fintype V]
[inst_2 : DecidableRel G.Adj],
Disjoint (G.edgeFinset \ G.incidenceFinset t) (Finset.image (fun x => s(x, t)) (G.neighborFinset s))- Cited by
- 2 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement and proof · cited by 3,072
- Disjointstatement · cited by 2,201
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Finset.imagestatement and proof · cited by 910
- Sym2statement and proof · cited by 737
- Sym2.mkstatement and proof · cited by 332
- SimpleGraph.neighborSetstatement · cited by 257
- SimpleGraph.edgeSetproof · cited by 199
- SimpleGraph.edgeFinsetstatement and proof · cited by 116
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.card_edgeFinset_replaceVertex_of_not_adjproof · cited by 2
- SimpleGraph.card_edgeFinset_replaceVertex_of_adjproof · cited by 1