Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree
Abstract
In this paper we make a partial progress on the following conjecture: for every $\mu>0$ and large enough $n$, every Steiner triple system $S$ on at least $(1+\mu)n$ vertices contains every hypertree $T$ on $n$ vertices. We prove that the conjecture holds if $T$ is a perfect $d$-ary hypertree.
Published
2022-07-15
How to Cite
Arman, A., Rödl, V., & Sales, M. T. (2022). Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. The Electronic Journal of Combinatorics, 29(3), P3.17. https://doi.org/10.37236/10454
Article Number
P3.17