Tight Bounds for Hypercube Minor-Universality
Emma Hogan, Lukas Michel, Alex Scott, Youri Tamitegama, Jane Tan,, Dmitry Tsarev

TL;DR
This paper establishes tight bounds on the minor-universality of hypercubes, showing they do not contain certain expanders as minors, thus refining understanding of hypercube minor-embedding limits.
Contribution
It proves that hypercubes do not contain 3-uniform expanders with a certain number of edges as minors, matching previous lower bounds and answering an open question.
Findings
Hypercubes do not contain certain expanders as minors.
Results match the known lower bounds up to a constant factor.
Answers an open question about hypercube minor-universality.
Abstract
Benjamini, Kalifa and Tzalik recently proved that there is an absolute constant such that any graph with at most edges and no isolated vertices is a minor of the -dimensional hypercube , while there is an absolute constant such that is not -minor-universal. We show that does not contain 3-uniform expander graphs with edges as minors. This matches the lower bound up to a constant factor and answers one of their questions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Optimization and Search Problems
