Theorems · Theorem · combinatorics

SimpleGraph.edgeDensity_add_edgeDensity_compl

∀ {α : Type u_4} (G : SimpleGraph α) [inst : DecidableRel G.Adj] {s t : Finset α} [inst_1 : DecidableEq α],
  s.Nonempty → t.Nonempty → Disjoint s t → G.edgeDensity s t + Gᶜ.edgeDensity s t = 1

Defined in

Mathlib.Combinatorics.SimpleGraph.Density

Cited by

0 results in Mathlib

Foundations

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

Assumes

DecidableRelDecidableEq