Theorems · Definition · combinatorics
SimpleGraph.Subgraph.neighborSet
{V : Type u} → {G : SimpleGraph V} → G.Subgraph → V → Set VG'.neighborSet v is the set of vertices adjacent to v in G'.
- Cited by
- 46 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.
Cites5
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.Subgraphstatement and proof · cited by 326
- SimpleGraph.Subgraph.Adjproof · cited by 147
Cited by49
Results whose statement or proof uses this declaration.
- SimpleGraph.Subgraph.degreestatement and proof · cited by 14
- SimpleGraph.Subgraph.neighborSet_subsetstatement · cited by 4
- SimpleGraph.Walk.IsCycle.ncard_neighborSet_toSubgraph_eq_twostatement and proof · cited by 3
- SimpleGraph.Subgraph.adj_iff_of_neighborSet_equivstatement and proof · cited by 3
- SimpleGraph.Subgraph.coe_degreestatement and proof · cited by 3
- SimpleGraph.Walk.IsCycle.neighborSet_toSubgraph_endpointstatement · cited by 2
- SimpleGraph.Subgraph.degree_eq_zero_of_subsingletonstatement and proof · cited by 2
- SimpleGraph.neighborSet_fst_subgraphOfAdjstatement · cited by 2
- SimpleGraph.Walk.finite_neighborSet_toSubgraphstatement and proof · cited by 1
- SimpleGraph.Walk.IsCycle.neighborSet_toSubgraph_internalstatement · cited by 1
- SimpleGraph.Subgraph.coeNeighborSetEquivstatement and proof · cited by 1
- SimpleGraph.Subgraph.degree_of_notMem_vertsstatement and proof · cited by 1