Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsContained.girth_le

∀ {α : Type u_1} {β : Type u_2} {G : SimpleGraph α} {G' : SimpleGraph β},
  G.IsContained G' → ¬G.IsAcyclic → G'.girth ≤ G.girth
Defined in
Mathlib.Combinatorics.SimpleGraph.Girth
Cited by
0 results in Mathlib
Foundations
Depth 37 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph · cited by 3072SimpleGraphIff.not · cited by 489Iff.notSimpleGraph.IsContained · cited by 68SimpleGraph.IsContainedSimpleGraph.IsAcyclic · cited by 67SimpleGraph.IsAcyclicSimpleGraph.girth · cited by 11SimpleGraph.girthENat.toNat_le_toNat · cited by 6ENat.toNat_le_toNatSimpleGraph.egirth_eq_top · cited by 4SimpleGraph.egirth_eq_topSimpleGraph.IsContained.egirth_le · cited by 2IsContained.egirth_leIsContained.girth_leCITED BYCITES

Cites8

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.