Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Iso.egirth_eq

∀ {α : Type u_1} {β : Type u_2} {G : SimpleGraph α} {G' : SimpleGraph β} (f : G ≃g G'), G.egirth = G'.egirth
Defined in
Mathlib.Combinatorics.SimpleGraph.Girth
Cited by
1 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.Iso.girth_eq · cited by 0Iso.girth_eqENat · cited by 4985ENatSimpleGraph · cited by 3072SimpleGraphle_antisymm · cited by 2068le_antisymmSimpleGraph.Iso · cited by 99SimpleGraph.IsoSimpleGraph.egirth · cited by 17SimpleGraph.egirthSimpleGraph.Iso.isContained · cited by 5Iso.isContainedSimpleGraph.IsContained.egirth_le · cited by 2IsContained.egirth_leSimpleGraph.Iso.isContained' · cited by 2Iso.isContained'Iso.egirth_eqCITED BYCITES

Cites8

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

Cited by1

Results whose statement or proof uses this declaration.