Theorems · Theorem · combinatorics
SimpleGraph.girth_le_length
∀ {α : Type u_1} {G : SimpleGraph α} {a : α} {w : G.Walk a a}, w.IsCycle → G.girth ≤ w.length- Defined in
- Mathlib.Combinatorics.SimpleGraph.Girth
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LE.le.transproof · cited by 3,151
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkstatement and proof · cited by 915
- SimpleGraph.Walk.lengthstatement · cited by 212
- SimpleGraph.Walk.IsCyclestatement and proof · cited by 91
- ENat.natCast_le_natCastproof · cited by 19
- SimpleGraph.egirthproof · cited by 17
- SimpleGraph.girthstatement · cited by 11
- ENat.natCast_toNat_le_selfproof · cited by 6
- SimpleGraph.egirth_le_lengthproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.