Theorems · Theorem · combinatorics

SimpleGraph.degree_compl

∀ {V : Type u_1} (G : SimpleGraph V) (v : V) [inst : Fintype ↑(G.neighborSet v)] [inst_1 : Fintype ↑(Gᶜ.neighborSet v)]
  [inst_2 : Fintype V], Gᶜ.degree v = Fintype.card V - 1 - G.degree v

Defined in

Mathlib.Combinatorics.SimpleGraph.Finite

Cited by

1 results in Mathlib

Foundations

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

Assumes

FintypeFintypeFintype