Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsContained.maxDegree_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], G.IsContained H → G.maxDegree ≤ H.maxDegree
Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
2 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.IsContained.max_degree_le · cited by 0IsContained.max_degree_leSimpleGraph.maxDegree_mono · cited by 0SimpleGraph.maxDegree_monoFintype · cited by 7736FintypeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.IsContained · cited by 68SimpleGraph.IsContainedSimpleGraph.Copy · cited by 49SimpleGraph.CopySimpleGraph.maxDegree · cited by 19SimpleGraph.maxDegreeSimpleGraph.Copy.maxDegree_mono · cited by 3Copy.maxDegree_monoIsContained.maxDegree_monoCITED BYCITES

Cites7

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

Cited by2

Results whose statement or proof uses this declaration.