Theorems · Theorem · combinatorics
SimpleGraph.girth_anti
∀ {α : Type u_1} {G G' : SimpleGraph α}, G ≤ G' → ¬G.IsAcyclic → G'.girth ≤ G.girth- Defined in
- Mathlib.Combinatorics.SimpleGraph.Girth
- Cited by
- 0 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.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- Iff.notproof · cited by 489
- SimpleGraph.IsAcyclicstatement and proof · cited by 67
- SimpleGraph.girthstatement · cited by 11
- ENat.toNat_le_toNatproof · cited by 6
- SimpleGraph.egirth_eq_topproof · cited by 4
- SimpleGraph.egirth_antiproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.