Intersecting families of loose spanning hypertrees

Yury Person, Thomas Schweser

A loose hypertree is a hypergraph whose incidence graph is a tree. Let $b\ge 3$, $n\equiv 1(\mathrm{mod}b-1)$, and $s:=(n-1)/(b-1)$. We determine the largest $t$-intersecting families of lo…