Theorems · Theorem · combinatorics
SimpleGraph.diam_eq_zero_of_not_connected
∀ {α : Type u_1} {G : SimpleGraph α}, ¬G.Connected → G.diam = 0- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 37 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatproof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- IsEmptyproof · cited by 759
- isEmpty_or_nonemptyproof · cited by 269
- ENat.toNatproof · cited by 143
- bot_eq_zero'proof · cited by 92
- SimpleGraph.Connectedstatement and proof · cited by 75
- SimpleGraph.eccentproof · cited by 28
- ciSup_of_emptyproof · cited by 23
- SimpleGraph.diamstatement · cited by 15
- ENat.toNat_topproof · cited by 3
- SimpleGraph.ediam_eq_top_of_not_connectedproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.