Embedding hypertrees into steiner triple systems.

In this paper, we are interested in the following question: given an arbitrary Steiner triple system S on m vertices and any 3‐uniform hypertree T on n vertices, is it necessary that S contains T as a subgraph provided m≥(1+μ)n? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. [ABSTRACT FROM AUTHOR]