Theorems · Definition · combinatorics
Graph.incidenceSet
{α : Type u_1} → {β : Type u_2} → {G : Graph α β} → α → Set βG.incidenceSet x is the set of edges incident to x in G.
- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.ofPredproof · cited by 6,101
- Graphstatement and proof · cited by 242
- Graph.Incproof · cited by 42
Cited by3
Results whose statement or proof uses this declaration.
- Graph.incidenceSet_subset_edgeSetstatement and proof · cited by 0
- Graph.mem_incidenceSetstatement · cited by 0
- Graph.loopSet_subset_incidenceSetstatement · cited by 0