Theorems · Theorem · combinatorics
SimpleGraph.not_connected_bot
∀ {V : Type u} [Nontrivial V], ¬⊥.Connected- Cited by
- 3 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nontrivial
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement and proof · cited by 4,720
- SimpleGraphstatement · cited by 3,072
- Nontrivialstatement and proof · cited by 2,416
- SimpleGraph.Connectedstatement · cited by 75
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.radius_botproof · cited by 1
- SimpleGraph.ediam_botproof · cited by 1
- SimpleGraph.eccent_botproof · cited by 1