Theorems · Theorem · combinatorics
SimpleGraph.egirth_top
∀ {α : Type u_1}, 3 ≤ ENat.card α → ⊤.egirth = 3- Defined in
- Mathlib.Combinatorics.SimpleGraph.Girth
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- ENatstatement · cited by 4,985
- SimpleGraphstatement · cited by 3,072
- zero_addproof · cited by 2,366
- Finset.cardproof · cited by 2,327
- le_antisymmproof · cited by 2,068
- le_reflproof · cited by 2,061
- SimpleGraph.Walkproof · cited by 915
- le_imp_le_of_le_of_leproof · cited by 576
- SimpleGraph.Walk.lengthproof · cited by 212
- SimpleGraph.Walk.IsCycleproof · cited by 91
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.girth_topproof · cited by 0