Theorems · Theorem · combinatorics
SimpleGraph.fromEdgeSet_edgeSet
∀ {V : Type u} (G : SimpleGraph V), SimpleGraph.fromEdgeSet G.edgeSet = G- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 2 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.
Cites6
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.Adjproof · cited by 1,346
- SimpleGraph.edgeSetstatement and proof · cited by 199
- SimpleGraph.extproof · cited by 59
- SimpleGraph.fromEdgeSetstatement and proof · cited by 43
- SimpleGraph.ne_of_adjproof · cited by 14
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.binomialRandom_eq_mapproof · cited by 2
- SimpleGraph.edgeSet_eq_iffproof · cited by 0