Theorems · Definition · combinatorics
Graph.edgeSet
{α : Type u_3} → {β : Type u_4} → Graph α β → Set βThe edge set.
- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 79 results in Mathlib
- Foundations
- Depth 1 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.
Cited by86
Results whose statement or proof uses this declaration.
- Graph.Compatibleproof · cited by 21
- Graph.restrictproof · cited by 18
- Graph.mapproof · cited by 16
- Graph.IsLink.edge_memstatement · cited by 14
- Graph.deleteEdgesproof · cited by 12
- Graph.extproof · cited by 10
- Graph.Compatible.extstatement and proof · cited by 9
- Graph.Compatible.of_le_leproof · cited by 9
- Graph.IsSubgraph.edgeSet_monostatement and proof · cited by 8
- Graph.edgeSet_restrictstatement and proof · cited by 7
- Graph.exists_isLink_of_mem_edgeSetstatement and proof · cited by 6
- Graph.Inc.edge_memstatement · cited by 6