Theorems · Theorem · combinatorics
SimpleGraph.edist_le
∀ {V : Type u_1} {G : SimpleGraph V} {u v : V} (p : G.Walk u v), G.edist u v ≤ ↑p.length- Defined in
- Mathlib.Combinatorics.SimpleGraph.Metric
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 33 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.lengthstatement · cited by 212
- sInf_leproof · cited by 110
- SimpleGraph.ediststatement · cited by 55
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.edist_eq_one_iff_adjproof · cited by 5
- SimpleGraph.edist_triangleproof · cited by 2
- SimpleGraph.edist_antiproof · cited by 1
- SimpleGraph.Walk.edist_leproof · cited by 1
- SimpleGraph.edist_boxProdproof · cited by 0