Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.compl_adjMatrix_completeGraph

∀ (α : Type u_1) (V : Type u_2) [inst : Zero α] [inst_1 : One α] [inst_2 : DecidableEq α] [inst_3 : DecidableEq V],
  (SimpleGraph.adjMatrix α (SimpleGraph.completeGraph V)).compl = 0
Defined in
Mathlib.Combinatorics.SimpleGraph.AdjMatrix
Cited by
2 results in Mathlib
Foundations
Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
ZeroOneDecidableEqDecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Matrix.compl_zero · cited by 1Matrix.compl_zeroMatrix.compl_of_one_sub_one · cited by 0Matrix.compl_of_one_sub_o…DFunLike.coe · cited by 62936DFunLike.coeMatrix · cited by 4303MatrixMatrix.of · cited by 336Matrix.ofSimpleGraph.completeGraph · cited by 49SimpleGraph.completeGraphSimpleGraph.adjMatrix · cited by 48SimpleGraph.adjMatrixMatrix.compl · cited by 17Matrix.complSimpleGraph.compl_adjMatrix_c…CITED BYCITES

Cites6

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

Cited by2

Results whose statement or proof uses this declaration.