Limit lemma: nested safe words (any stage orders, e.g. tree orders) covering $\mathbb{Z}$ give a 4-AP-free bijection

Initializing...

Limit lemma: nested safe words (any stage orders, e.g. tree orders) covering $\mathbb{Z}$ give a 4-AP-free bijection · Prove2Me