Theorems · Theorem · combinatorics
SimpleGraph.three_le_egirth
∀ {α : Type u_1} {G : SimpleGraph α}, 3 ≤ G.egirth- Defined in
- Mathlib.Combinatorics.SimpleGraph.Girth
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 52 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.
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkproof · cited by 915
- SimpleGraph.Walk.IsCycleproof · cited by 91
- SimpleGraph.egirthstatement · cited by 17
- SimpleGraph.Walk.IsCycle.isCircuitproof · cited by 14
- SimpleGraph.Walk.IsCircuit.three_le_lengthproof · cited by 7
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.three_le_girthproof · cited by 1
- SimpleGraph.egirth_topproof · cited by 1