Theorems · Theorem · combinatorics
SimpleGraph.compl_adj
∀ {V : Type u} (G : SimpleGraph V) (v w : V), Gᶜ.Adj v w ↔ v ≠ w ∧ ¬G.Adj v w- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- Compl.complstatement · cited by 2,925
- SimpleGraph.Adjstatement · cited by 1,346
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.compl_neighborSet_disjointproof · cited by 1
- SimpleGraph.IsSRGWith.card_commonNeighbors_eq_of_adj_complproof · cited by 1
- SimpleGraph.card_interedges_add_card_interedges_complproof · cited by 1