I suspect that the algorithm is wrong because the complexity is suspiciously good. https://en.m.wikipedia.org/wiki/Triangle-free_graph#Triangle...

It looks like this algorithm is solving for whether the graph contains at least one triangle rather than counting or listing all triangles.

„… which it follows that triangle detection can be solved in time O(m^{1.407})“