Theorems · Theorem · combinatorics
SimpleGraph.eq_bot_iff_forall_not_adj
∀ {V : Type u} {G : SimpleGraph V}, G = ⊥ ↔ ∀ (a b : V), ¬G.Adj a b- Defined in
- Mathlib.Combinatorics.SimpleGraph.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, 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.
- Bot.botstatement · cited by 4,720
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.colorable_one_iffproof · cited by 1
- SimpleGraph.support_eq_bot_iffproof · cited by 0