Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory · 2026-08 · 112 (4) · 433-437
DOI: 10.1002/jgt.70035 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 10.04.2026. Verfasst von Emma Hogan und 5 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Engineering and Physical Sciences Research Council.
Abstract (Originalsprache)
A graph is ‐minor‐universal if every graph with at most edges and no isolated vertices is contained as a minor in . Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant such that the ‐dimensional hypercube is ()‐minor‐universal, 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.
Förderung
- Engineering and Physical Sciences Research Council
Zitieren
APA
Hogan, E., Michel, L., Scott, A., Tamitegama, Y., Tan, J., & Tsarev, D. (2026). Tight Bounds for Hypercube Minor‐Universality. Journal of Graph Theory, 112(4), 433-437. https://doi.org/10.1002/jgt.70035
Vancouver
Hogan E, Michel L, Scott A, Tamitegama Y, Tan J, Tsarev D. Tight Bounds for Hypercube Minor‐Universality. Journal of Graph Theory. 2026;112(4):433-437. doi:10.1002/jgt.70035
BibTeX
@article{Hogan2026,
author = {Hogan, Emma and Michel, Lukas and Scott, Alex and Tamitegama, Youri and Tan, Jane and Tsarev, Dmitry},
title = {Tight Bounds for Hypercube Minor‐Universality},
journal = {Journal of Graph Theory},
year = {2026},
volume = {112},
number = {4},
pages = {433--437},
doi = {10.1002/jgt.70035}
}
EUVIMED