Theorems · Theorem · combinatorics

SimpleGraph.IsUniform.mono

∀ {α : Type u_1} {𝕜 : Type u_2} [inst : Field 𝕜] [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] {G : SimpleGraph α}
  [inst_3 : DecidableRel G.Adj] {ε : 𝕜} {s t : Finset α} {ε' : 𝕜}, ε ≤ ε' → G.IsUniform ε s t → G.IsUniform ε' s t

Defined in

Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform

Cited by

2 results in Mathlib

Foundations

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

Assumes

FieldLinearOrderIsStrictOrderedRingDecidableRel