Theorems · Theorem · combinatorics
SimpleGraph.compl_neighborSet_disjoint
∀ {V : Type u} (G : SimpleGraph V) (v : V), Disjoint (G.neighborSet v) (Gᶜ.neighborSet v)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Compl.complstatement and proof · cited by 2,925
- Disjointstatement · cited by 2,201
- SimpleGraph.neighborSetstatement and proof · cited by 257
- Set.disjoint_iffproof · cited by 27
- SimpleGraph.mem_neighborSetproof · cited by 4
- SimpleGraph.compl_adjproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.degree_complproof · cited by 1