Theorems · Theorem · combinatorics
SimpleGraph.IsContained.egirth_le
∀ {α : Type u_1} {β : Type u_2} {G : SimpleGraph α} {G' : SimpleGraph β}, G.IsContained G' → G'.egirth ≤ G.egirth- Defined in
- Mathlib.Combinatorics.SimpleGraph.Girth
- Cited by
- 2 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.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement and proof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Walkproof · cited by 915
- Nonempty.someproof · cited by 340
- SimpleGraph.Walk.lengthproof · cited by 212
- SimpleGraph.Walk.IsCycleproof · cited by 91
- SimpleGraph.IsContainedstatement and proof · cited by 68
- SimpleGraph.IsAcyclicproof · cited by 67
- SimpleGraph.egirthstatement and proof · cited by 17
- SimpleGraph.Copy.toHomproof · cited by 14
- SimpleGraph.Walk.length_mapproof · cited by 8
- SimpleGraph.egirth_le_lengthproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.Iso.egirth_eqproof · cited by 1
- SimpleGraph.IsContained.girth_leproof · cited by 0