Theorems · Definition · combinatorics

Finpartition.sparsePairs

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

The pairs of parts of a partition P which are not ε-dense in a graph G. Note that we dismiss the diagonal. We do not care whether s is ε-dense with itself.

Defined in

Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform

Cited by

7 results in Mathlib

Foundations

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

Assumes

FieldLinearOrderDecidableEqDecidableRel