English

Bounded Degree Spanners of the Hypercube

Combinatorics 2019-10-23 v1

Abstract

In this short note we study two questions about the existence of subgraphs of the hypercube QnQ_n with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree subgraph of QnQ_n which has diameter nn. We answer this question by giving an explicit construction of such a subgraph with maximum degree at most 120. The second problem concerns properties of kk-additive spanners of the hypercube, that is, subgraphs of QnQ_n in which the distance between any two vertices is at most kk larger than in QnQ_n. Denoting by Δk,(n)\Delta_{k,\infty}(n) the minimum possible maximum degree of a kk-additive spanner of QnQ_n, Arizumi--Hamburger--Kostochka showed that nlnne4kΔ2k,(n)20nlnnlnlnn.\frac{n}{\ln n}e^{-4k}\leq \Delta_{2k,\infty}(n)\leq 20\frac{n}{\ln n}\ln \ln n. We improve their upper bound by showing that Δ2k,(n)104knlnnln(k+1)n,\Delta_{2k,\infty}(n)\leq 10^{4k} \frac{n}{\ln n}\ln^{(k+1)}n,where the last term denotes a k+1k+1-fold iterated logarithm.

Keywords

Cite

@article{arxiv.1910.09868,
  title  = {Bounded Degree Spanners of the Hypercube},
  author = {Rajko Nenadov and Mehtaab Sawhney and Benny Sudakov and Adam Zsolt Wagner},
  journal= {arXiv preprint arXiv:1910.09868},
  year   = {2019}
}

Comments

10 pages

R2 v1 2026-06-23T11:51:01.777Z