Theorems · Theorem · combinatorics
Graph.edgeSet_eq_empty
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β}, G.edgeSet = ∅ ↔ G = Graph.noEdge G.vertexSet β- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Graphstatement and proof · cited by 242
- Graph.IsLinkproof · cited by 124
- Graph.vertexSetstatement and proof · cited by 87
- Graph.edgeSetstatement and proof · cited by 79
- Graph.IsLink.edge_memproof · cited by 14
- Graph.noEdgestatement and proof · cited by 10
- Graph.extproof · cited by 10
- Graph.edgeSet_noEdgeproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.