The following very simple answer addresses worst-case complexity. How to do the reduction in practice would be a different question, as would average complexity (as pointed out by logicute).
For a graph $G$, let $\hat{G}$ denote the barycentric subdivision of $G$. This is triangle-free. I claim ...
Room for Jim and Thomas Klimpel
Room for Jim and Thomas Klimpel