Theorems · Theorem · combinatorics

SimpleGraph.IsExtremal.le_iff_eq

∀ {V : Type u_1} [inst : Fintype V] {G : SimpleGraph V} [inst_1 : DecidableRel G.Adj] {p : SimpleGraph V → Prop},
  G.IsExtremal p → ∀ {H : SimpleGraph V}, p H → (G ≤ H ↔ G = H)

Defined in

Mathlib.Combinatorics.SimpleGraph.Extremal.Basic

Cited by

1 results in Mathlib

Foundations

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

Assumes

FintypeDecidableRel