Multiplicative error set system sparsification: A simpler proof via chain length contraction

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

The chain length of a set family $\mathcal{S}\subseteq 2^{[m]}$ is the largest ascending sequence of sets in containment order in the union-closure of $\mathcal{S}$. In this work,…