The Steiner distance problem for large vertex subsets in the hypercube
Combinatorics
2019-07-18 v1
Abstract
We find the asymptotic behavior of the Steiner k-diameter of the -cube if is large. Our main contribution is the lower bound, which utilizes the probabilistic method.
Keywords
Cite
@article{arxiv.1907.07546,
title = {The Steiner distance problem for large vertex subsets in the hypercube},
author = {Éva Czabarka and Josiah Reiswig and László Székely},
journal= {arXiv preprint arXiv:1907.07546},
year = {2019}
}