Theorems · Theorem · combinatorics

SimpleGraph.IsTuranMaximal.card_parts_le

∀ {V : Type u_1} [inst : Fintype V] {G : SimpleGraph V} [inst_1 : DecidableRel G.Adj] {r : ℕ} (h : G.IsTuranMaximal r)
  [inst_2 : DecidableEq V], h.finpartition.parts.card ≤ r

Defined in

Mathlib.Combinatorics.SimpleGraph.Extremal.Turan

Cited by

1 results in Mathlib

Foundations

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

Assumes

FintypeDecidableRelDecidableEq