Mathlib Map

Theorems · Definition · combinatorics

SzemerediRegularity.bound

ℝ → ℕ → ℕ

An explicit bound on the size of the equipartition whose existence is given by Szemerédi's regularity lemma.

Defined in
Mathlib.Combinatorics.SimpleGraph.Regularity.Bound
Cited by
8 results in Mathlib
Foundations
Depth 170 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

SimpleGraph.triangleRemovalBound · cited by 7SimpleGraph.triangleRemov…SzemerediRegularity.initialBound_le_bound · cited by 3SzemerediRegularity.initi…SzemerediRegularity.bound_pos · cited by 2SzemerediRegularity.bound…SimpleGraph.FarFromTriangleFree.le_card_cliqueFinset · cited by 2FarFromTriangleFree.le_ca…SimpleGraph.triangleRemovalBound_mul_cube_lt · cited by 1SimpleGraph.triangleRemov…SimpleGraph.triangleRemovalBound_nonpos · cited by 1SimpleGraph.triangleRemov…szemeredi_regularity · cited by 1szemeredi_regularitySimpleGraph.triangleRemovalBound_le · cited by 0SimpleGraph.triangleRemov…SzemerediRegularity.le_bound · cited by 0SzemerediRegularity.le_bo…Real · cited by 25697RealNat.iterate · cited by 740Nat.iterateNat.floor · cited by 215Nat.floorSzemerediRegularity.stepBound · cited by 24SzemerediRegularity.stepB…SzemerediRegularity.initialBound · cited by 6SzemerediRegularity.initi…SzemerediRegularity.boundCITED BYCITES

Cites5

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

Cited by9

Results whose statement or proof uses this declaration.