Theorems · Definition · combinatorics
SzemerediRegularity.stepBound
ℕ → ℕ
Auxiliary function for Szemerédi's regularity lemma. Blowing up a partition of size n during
the induction results in a partition of size at most stepBound n.
- Cited by
- 24 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by26
Results whose statement or proof uses this declaration.
- SzemerediRegularity.chunkproof · cited by 11
- SzemerediRegularity.boundproof · cited by 8
- SzemerediRegularity.a_add_one_le_four_pow_parts_cardstatement · cited by 4
- SzemerediRegularity.card_eq_of_mem_parts_chunkstatement and proof · cited by 3
- SzemerediRegularity.initialBound_le_boundproof · cited by 3
- SzemerediRegularity.m_posstatement and proof · cited by 3
- SzemerediRegularity.card_aux₁statement and proof · cited by 2
- SzemerediRegularity.card_aux₂statement and proof · cited by 2
- SzemerediRegularity.card_chunkstatement and proof · cited by 2
- SzemerediRegularity.card_incrementstatement and proof · cited by 2
- SzemerediRegularity.le_stepBoundstatement · cited by 2
- SzemerediRegularity.stepBound_posstatement · cited by 2