Theorems · Theorem · combinatorics
SimpleGraph.ediam_anti
∀ {α : Type u_1} {G G' : SimpleGraph α}, G ≤ G' → G'.ediam ≤ G.ediam- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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.ediamstatement · cited by 44
- iSup₂_monoproof · cited by 18
- SimpleGraph.edist_antiproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.diam_anti_of_ediam_ne_topproof · cited by 0