The Steiner distance problem for large vertex subsets in the hypercube

Abstract

We find the asymptotic behavior of the Steiner k-diameter of the $n$-cube if $k$ is large. Our main contribution is the lower bound, which utilizes the probabilistic method.