Theorems · Theorem · combinatorics
SimpleGraph.incMatrix_apply_mul_incMatrix_apply_of_not_adj
∀ {R : Type u_1} {α : Type u_2} (G : SimpleGraph α) [inst : MulZeroOneClass R] [inst_1 : DecidableEq α]
[inst_2 : DecidableRel G.Adj] {a b : α} {e : Sym2 α},
a ≠ b → ¬G.Adj a b → SimpleGraph.incMatrix R G a e * SimpleGraph.incMatrix R G b e = 0- Cited by
- 1 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · 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
- MulZeroOneClassstatement and proof · cited by 184
- Set.indicator_of_notMemproof · cited by 154
- Set.notMem_emptyproof · cited by 35
- SimpleGraph.incMatrixstatement · cited by 16
- SimpleGraph.incMatrix_apply_mul_incMatrix_applyproof · cited by 2
- SimpleGraph.incidenceSet_inter_incidenceSet_of_not_adjproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.incMatrix_mul_transposeproof · cited by 0