Optimal Small Set Expanders and Their Codes

Tristram Bogart, Marcelo Fiori, Pedro Raigorodsky +1

A left-regular bipartite graph $G$ of degree $d$ is called a $(t,\hat{I}\pm )$-small-set-expander if every subset $X$ of left vertices of size at most $t$ has at least $\hat{I}\pm |X|$ neighbors. Su…