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

2021/05/23 by Arman, Andrii, Rödl, Vojtěch, Sales, Marcelo Tadeu
#05B05 #05B07 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2105.10969

Abstract

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.

Related

• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
• A construction of almost Steiner systems
• Binomial partial Steiner triple systems with complete graphs: structural problems
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Codegree conditions for (fractional) Steiner triple systems