Theorems · Theorem · combinatorics

SimpleGraph.isTuranMaximal_of_iso

∀ {V : Type u_1} [inst : Fintype V] {G : SimpleGraph V} [inst_1 : DecidableRel G.Adj] {n r : ℕ}
  (f : G ≃g SimpleGraph.turanGraph n r), 0 < r → G.IsTuranMaximal r

Turán's theorem, reverse direction. Any graph isomorphic to turanGraph n r is itself Turán-maximal if 0 < r.

Defined in

Mathlib.Combinatorics.SimpleGraph.Extremal.Turan

Cited by

3 results in Mathlib

Foundations

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

Assumes

FintypeDecidableRel