Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsContained.max_degree_le

Deprecated since 2026-05-20Use SimpleGraph.IsContained.maxDegree_mono instead.

∀ {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

Alias of SimpleGraph.IsContained.maxDegree_mono.

Defined in
Mathlib.Combinatorics.SimpleGraph.Copy
Cited by
0 results in Mathlib
Foundations
Depth 85 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.

Fintype · cited by 7736FintypeSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.IsContained · cited by 68SimpleGraph.IsContainedSimpleGraph.maxDegree · cited by 19SimpleGraph.maxDegreeSimpleGraph.IsContained.maxDegree_mono · cited by 2IsContained.maxDegree_monoIsContained.max_degree_leCITED BYCITES

Cites6

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.