Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Hom.minDegree_mono

∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} [inst : Fintype V] [inst_1 : Fintype W]
  [inst_2 : DecidableRel G.Adj] [inst_3 : DecidableRel H.Adj] {f : G →g H},
  Function.Bijective ⇑f → G.minDegree ≤ H.minDegree
Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
1 results in Mathlib
Foundations
Depth 84 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
FintypeFintypeDecidableRelDecidableRel
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.Hom.minDegree_le · cited by 0Hom.minDegree_leDFunLike.coe · cited by 62936DFunLike.coeFintype · cited by 7736FintypeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjFunction.Bijective · cited by 863Function.BijectiveSimpleGraph.Hom · cited by 139SimpleGraph.HomFunction.Bijective.surjective · cited by 114Bijective.surjectiveSimpleGraph.minDegree · cited by 25SimpleGraph.minDegreeSimpleGraph.Copy.minDegree_mono · cited by 2Copy.minDegree_monoHom.minDegree_monoCITED BYCITES

Cites9

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.