Great question! Here is an upper bound: let $\frac{p_n}{q_n}$ be the sequence of convergents to the continued fraction of $\sqrt{3}$. It is known that $| \sqrt{3} - \frac{p_n}{q_n} | < \frac{1}{q_n q_{n+1}}$. Then the vertices
$$(0, 0), (2q_n, 0), (q_n, p_n)$$
are within $|\sqrt{3} q_n - p_n| < \frac{1}{q_{n+1}}$ of an equilateral triangle. Asymptotically I believe that $q_n \sim C \cdot \sqrt{3}^n$ for some constant $C$, which means that for small $\delta$ we can always find a triangle with side length something like $\frac{2}{\delta}$.
Here is a way to get a lower bound: suppose $(x_i, y_i)$ is a collection of points which are $\delta$-close to an equilateral triangle, and suppose WLOG that $(x_1, y_1) = (0, 0)$. Then $\frac{x_3 + iy_3}{x_2 + iy_2}$ is a rational approximation to $\frac{1}{2} + \frac{\sqrt{3}}{2} i$, hence taking imaginary parts, $2 \frac{x_2 y_3 - x_3 y_2}{x_2^2 + y_2^2}$ is a rational approximation to $\sqrt{3}$. It is known that the convergents $\frac{p_n}{q_n}$ give the best rational approximations to $\sqrt{3}$ (in the sense that better ones must have larger denominators), so one should be able to write down how good this approximation is in terms of $\delta$ and use this to give a lower bound on how large $x_2^2 + y_2^2$ must be. But the details look messy. In any case, I would be very surprised if one didn't end up with a lower bound of the form $\frac{C}{\delta}$.