Theorems · Definition · combinatorics
SimpleGraph.neighborSet
{V : Type u} → SimpleGraph V → V → Set VG.neighborSet v is the set of vertices adjacent to v in G.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 257 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 5 definitions · 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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjproof · cited by 1,346
Cited by273
Results whose statement or proof uses this declaration.
- SimpleGraph.degreestatement and proof · cited by 112
- SimpleGraph.neighborFinsetstatement and proof · cited by 72
- SimpleGraph.commonNeighborsproof · cited by 28
- SimpleGraph.LocallyFiniteproof · cited by 18
- SimpleGraph.incidenceFinsetstatement and proof · cited by 15
- SimpleGraph.IsCyclesproof · cited by 12
- SimpleGraph.card_neighborSet_eq_degreestatement and proof · cited by 9
- SimpleGraph.coe_neighborFinsetstatement and proof · cited by 9
- SimpleGraph.mem_neighborFinsetstatement and proof · cited by 6
- SimpleGraph.minDegree_le_degreestatement · cited by 6
- SimpleGraph.neighborFinset_eq_filterstatement · cited by 6
- SimpleGraph.IsIsolated.degree_eq_zerostatement and proof · cited by 6
Showing the 200 most cited of 273.