Theorems · Theorem · combinatorics

SimpleGraph.le_minDegree_induce_of_support_subset

∀ {V : Type u_1} {s : Set V} [inst : DecidablePred fun x => x ∈ s] [inst_1 : Fintype V] {G : SimpleGraph V}
  [inst_2 : DecidableRel G.Adj], G.support ⊆ s → G.minDegree ≤ (SimpleGraph.induce s G).minDegree

Defined in

Mathlib.Combinatorics.SimpleGraph.Finite

Cited by

0 results in Mathlib

Foundations

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

Assumes

DecidablePredFintypeDecidableRel