Ruzsa's covering lemma #
This file proves the Ruzsa covering lemma. This says that, for s
, t
finsets, we can cover s
with at most (s + t).card / t.card
copies of t - t
.
TODO #
Merge this file with other prerequisites to Freiman's theorem once we have them.