Every Steiner triple system contains an almost spanning d-ary hypertree

05/23/2021

∙

by   Andrii Arman, et al.

∙

0

∙

share

In this paper we make a partial progress on the following conjecture: for every μ>0 and large enough n, every Steiner triple system S on at least (1+μ)n vertices contains every hypertree T on n vertices. We prove that the conjecture holds if T is a perfect d-ary hypertree.