Theorems · Theorem · combinatorics

SimpleGraph.minDegree_le_minDegree

∀ {V : Type u_1} {G : SimpleGraph V} [inst : Fintype V] {H : SimpleGraph V} [inst_1 : DecidableRel G.Adj]
  [inst_2 : DecidableRel H.Adj], G ≤ H → G.minDegree ≤ H.minDegree

If G is a subgraph of H then G.minDegree ≤ H.minDegree.

Defined in

Mathlib.Combinatorics.SimpleGraph.Finite

Cited by

1 results in Mathlib

Foundations

Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

FintypeDecidableRelDecidableRel