SimpleGraph.DeleteFar

{V : Type u_1} →
  (G : SimpleGraph V) →
    {𝕜 : Type u_2} → [Ring 𝕜] → [PartialOrder 𝕜] → [Fintype ↑G.edgeSet] → (SimpleGraph V → Prop) → 𝕜 → Prop

A graph is r-delete-far from a property p if we must delete at least r edges from it to get a graph with the property p.

Defined in: Mathlib.Combinatorics.SimpleGraph.DeleteEdges
Cited by: 4 results in Mathlib
Foundations: Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Ring PartialOrder 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.