Theorems · Theorem · combinatorics
SimpleGraph.fromEdgeSet_empty
∀ {V : Type u}, SimpleGraph.fromEdgeSet ∅ = ⊥- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Bot.botstatement · cited by 4,720
- SimpleGraphstatement · cited by 3,072
- Sym2statement · cited by 737
- Sym2.mkproof · cited by 332
- SimpleGraph.extproof · cited by 59
- SimpleGraph.fromEdgeSetstatement · cited by 43
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.deleteEdges_emptyproof · cited by 1
- SimpleGraph.maximal_isAcyclic_iff_reachable_eqproof · cited by 1
- SimpleGraph.binomialRandom_zeroproof · cited by 0