Before revision:   We also consider the problem of approximate triangle counting in sparse graphs, parameterizing by the number of edges m.
After revision:  Our algorithm improves upon the state of the art when T = \omega(1) and T = o(n). We also consider the problem of approximate triangle counting in sparse graphs, parameterizing by the number of edges m.