Theorems · Theorem · combinatorics
SimpleGraph.symm
∀ {V : Type u} (self : SimpleGraph V), Std.Symm self.Adj- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
Cited by10
Results whose statement or proof uses this declaration.
- SimpleGraph.toSubgraphproof · cited by 10
- SimpleGraph.edgeSetEmbeddingproof · cited by 8
- SimpleGraph.edgeSet_subset_compl_diagSetproof · cited by 2
- SimpleGraph.edgeDensity_commproof · cited by 1
- SimpleGraph.IsClique.insertproof · cited by 1
- SimpleGraph.swap_mem_interedges_iffproof · cited by 0
- SimpleGraph.isClique_insert_of_notMemproof · cited by 0
- SimpleGraph.isClique_insertproof · cited by 0
- SimpleGraph.mk_mem_interedges_commproof · cited by 0
- SimpleGraph.isClique_pairproof · cited by 0