Theorems · Theorem · combinatorics
SimpleGraph.edist_triangle
∀ {V : Type u_1} {G : SimpleGraph V} {u v w : V}, G.edist u w ≤ G.edist u v + G.edist v w- Defined in
- Mathlib.Combinatorics.SimpleGraph.Metric
- Cited by
- 2 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.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topproof · cited by 9,680
- ENatstatement and proof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- eq_or_neproof · cited by 1,117
- SimpleGraph.Walkproof · cited by 915
- Nat.cast_addproof · cited by 586
- SimpleGraph.Walk.lengthproof · cited by 212
- SimpleGraph.Walk.appendproof · cited by 95
- top_addproof · cited by 55
- SimpleGraph.ediststatement and proof · cited by 55
- add_topproof · cited by 49
- SimpleGraph.Walk.length_appendproof · cited by 8
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_le_two_mul_eccentproof · cited by 1
- SimpleGraph.ediam_le_two_mul_radiusproof · cited by 0