Theorems · Theorem · combinatorics

Finpartition.isUniform_one

∀ {α : Type u_1} {𝕜 : Type u_2} [inst : Field 𝕜] [inst_1 : LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
  [inst_3 : DecidableEq α] {A : Finset α} (P : Finpartition A) (G : SimpleGraph α) [inst_4 : DecidableRel G.Adj],
  P.IsUniform G 1

Defined in: Mathlib.Combinatorics.SimpleGraph.Regularity.Uniform
Cited by: 1 results in Mathlib
Foundations: Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: Field LinearOrder IsStrictOrderedRing DecidableEq DecidableRel

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites19

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

Finsetstatement and proof · cited by 13,712
LinearOrderstatement and proof · cited by 8,572
Fieldstatement and proof · cited by 7,404
mul_oneproof · cited by 3,885
LE.le.transproof · cited by 3,151
SimpleGraphstatement and proof · cited by 3,072
IsStrictOrderedRingstatement and proof · cited by 2,490
Finset.cardproof · cited by 2,327
le_reflproof · cited by 2,061
SimpleGraph.Adjstatement and proof · cited by 1,346
Finpartitionstatement and proof · cited by 199
Finpartition.partsproof · cited by 184

Cited by1

Results whose statement or proof uses this declaration.

szemeredi_regularityproof · cited by 1