Brouwer's matching conjecture for Steiner triple systems

A Steiner triple system of order $n$ is a $3$-uniform hypergraph on $n$ vertices in which every pair of vertices lies in exactly one edge. A matching is a set of pairwise vertex-disjoint edges. Brouwer's conjecture. Every Steiner triple system of order $n$ has a matching of at least

$$\frac{n-4}{3}$$

edges. The conjecture is known for sufficiently large $n$, but is not stated as resolved for all orders in the paper.