Theorems · Theorem · combinatorics
SimpleGraph.edist_top_of_ne
∀ {V : Type u_1} {u v : V}, u ≠ v → ⊤.edist u v = 1- Defined in
- Mathlib.Combinatorics.SimpleGraph.Metric
- Cited by
- 1 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.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- ENatstatement · cited by 4,985
- SimpleGraphstatement · cited by 3,072
- SimpleGraph.ediststatement · cited by 55
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.eccent_topproof · cited by 4