Bounded degree spanners of the hypercube
From MaRDI portal
Abstract: In this short note we study two questions about the existence of subgraphs of the hypercube with certain properties. The first question, due to ErdH{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree subgraph of which has diameter . 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 -additive spanners of the hypercube, that is, subgraphs of in which the distance between any two vertices is at most larger than in . Denoting by the minimum possible maximum degree of a -additive spanner of , Arizumi--Hamburger--Kostochka showed that frac{n}{ln n}e^{-4k}leq Delta_{2k,infty}(n)leq 20frac{n}{ln n}ln ln n. We improve their upper bound by showing that Delta_{2k,infty}(n)leq 10^{4k} frac{n}{ln n}ln^{(k+1)}n,where the last term denotes a -fold iterated logarithm.
Recommendations
Cites work
- scientific article; zbMATH DE number 26495 (Why is no real title available?)
- scientific article; zbMATH DE number 867676 (Why is no real title available?)
- A survey of integrity
- Additive graph spanners
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Generating Low-Degree 2-Spanners
- Graph spanners: a tutorial review
- Hypercube subgraphs with minimal detours
- New additive spanners
- On 2-detour subgraphs of the hypercube
- On plane geometric spanners: a survey and open problems
- Onk-detour subgraphs of hypercubes
- The 4/3 additive spanner exponent is tight
- Two results about the hypercube
Cited in
(4)
This page was built for publication: Bounded degree spanners of the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782941)