SimpleGraph.exists_isExtremal_iff_exists

∀ {V : Type u_1} [inst : Fintype V] (p : SimpleGraph V → Prop), (∃ G x, G.IsExtremal p) ↔ ∃ G, p G

If one simple graph satisfies p, then there exists an extremal graph satisfying p.

Defined in: Mathlib.Combinatorics.SimpleGraph.Extremal.Basic
Cited by: 1 results in Mathlib
Foundations: Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Fintype

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.