An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that every n-vertex graph has at most 10^(n/5) ≈ 1.5849^n maximal induced matchings, and this bound is best possible. We prove that every n-vertex triangle-free graph has at most 3^(n/3) ≈ 1.4423^n maximal induced matchings, and this bound is attained by every disjoint union of copies of the complete bipartite graph K_{3,3}.