Theorems · Theorem · combinatorics
SimpleGraph.disjoint_incidenceFinset_of_disjoint
∀ {V : Type u_1} (G H : SimpleGraph V) (v : V) [inst : Fintype ↑(G.neighborSet v)] [inst_1 : DecidableEq V]
[inst_2 : Fintype ↑(H.neighborSet v)], Disjoint G H → Disjoint (G.incidenceFinset v) (H.incidenceFinset v)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 73 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.
Cites10
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
- Disjointstatement and proof · cited by 2,201
- Sym2statement · cited by 737
- SimpleGraph.neighborSetstatement and proof · cited by 257
- SimpleGraph.incidenceFinsetstatement · cited by 15
- SimpleGraph.coe_incidenceFinsetproof · cited by 4
- SimpleGraph.disjoint_incidenceSetproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.