Theorems · Theorem · combinatorics
SimpleGraph.incidenceFinset_eq_filter
∀ {V : Type u_1} (G : SimpleGraph V) (v : V) [inst : Fintype ↑(G.neighborSet v)] [inst_1 : DecidableEq V]
[inst_2 : Fintype ↑G.edgeSet], G.incidenceFinset v = {e ∈ G.edgeFinset | v ∈ e}- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEqFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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.Adjproof · cited by 1,346
- Finset.filterstatement · cited by 949
- Sym2statement and proof · cited by 737
- Finset.extproof · cited by 565
- SimpleGraph.neighborSetstatement and proof · cited by 257
- SimpleGraph.edgeSetstatement and proof · cited by 199
- SimpleGraph.edgeFinsetstatement · cited by 116
- Sym2.Relproof · cited by 43
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.Walk.IsEulerian.even_degree_iffproof · cited by 1