A linear -graph is called a (3-)hypertree if there exists exactly one path between each pair of two distinct vertices. A linear -graph is called a Steiner triple system if each pair of two distinct vertices belong to a unique edge. A simple greedy algorithm shows that every -vertex Steiner triple system contains all …