Theorems · Definition · combinatorics

Finpartition.IsUniform

{α : Type u_1} →
  {𝕜 : Type u_2} →
    [Field 𝕜] →
      [LinearOrder 𝕜] →
        [inst : DecidableEq α] → {A : Finset α} → Finpartition A → (G : SimpleGraph α) → [DecidableRel G.Adj] → 𝕜 → Prop

A finpartition of a graph's vertex set is ε-uniform (aka ε-regular) iff the proportion of its pairs of parts that are not ε-uniform is at most ε.

Defined in

Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform

Cited by

13 results in Mathlib

Foundations

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

Assumes

FieldLinearOrderDecidableEqDecidableRel