English

Tight Bounds for Hypercube Minor-Universality

Combinatorics 2025-02-11 v1

Abstract

Benjamini, Kalifa and Tzalik recently proved that there is an absolute constant c>0c>0 such that any graph with at most c2d/dc\cdot2^d/d edges and no isolated vertices is a minor of the dd-dimensional hypercube QdQ_d, while there is an absolute constant K>0K > 0 such that QdQ_d is not (K2d/d)(K\cdot2^d/\sqrt{d})-minor-universal. We show that QdQ_d does not contain 3-uniform expander graphs with C2d/dC\cdot2^d/d edges as minors. This matches the lower bound up to a constant factor and answers one of their questions.

Keywords

Cite

@article{arxiv.2502.06629,
  title  = {Tight Bounds for Hypercube Minor-Universality},
  author = {Emma Hogan and Lukas Michel and Alex Scott and Youri Tamitegama and Jane Tan and Dmitry Tsarev},
  journal= {arXiv preprint arXiv:2502.06629},
  year   = {2025}
}

Comments

7 pages, 1 figure

R2 v1 2026-06-28T21:38:49.265Z