Theorems · Theorem · combinatorics
SimpleGraph.neighborFinset_def
∀ {V : Type u_1} (G : SimpleGraph V) (v : V) [inst : Fintype ↑(G.neighborSet v)],
G.neighborFinset v = (G.neighborSet v).toFinset- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 29 from the axioms · uses propext, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.neighborSetstatement and proof · cited by 257
- Set.toFinsetstatement · cited by 217
- SimpleGraph.neighborFinsetstatement · cited by 72
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.isBipartiteWith_neighborFinset_disjoint'proof · cited by 1
- SimpleGraph.map_neighborFinset_induce_of_neighborSet_subsetproof · cited by 1
- SimpleGraph.isBipartiteWith_neighborFinset_disjointproof · cited by 1