The ineffectiveness of the regularity lemma for bounded degree graphs

We show that for any $\mathrm{\Delta }\ge 3$, there is no bound computable from $(\epsilon ,r)$ on the size of a graph required to approximate a graph of maximum degree at most $\mathrm{\Delta }$ up to $\epsilon$ error in $r$-neighborhood statistics. This provides a negative answer to a question posed by Lovász. Our result is a direct consequence of the recent celebrated work of Bowen, Chapman, Lubotzky, and Vidick, which refutes the Aldous-Lyons conjecture.