Hypercube minor-universality

DOI10.1016/J.EJC.2025.104317MaRDI QIDQ6872460zbMATH OpenFDO

Authors Itai Benjamini, Or Bernard Kalifa, Elad Tzalik

Publication date 20 January 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104317

zbMATH Keywords

clique minors in graphsthick embedding

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65) Graph minors (05C83)

Cites work

• A Remark on Stirling's Formula
• Complete Minors in Graphs Without Sparse Cuts
• Expanders -- how to find them, and what to find in them
• Expansion in supercritical random subgraphs of the hypercube and its consequences
• Generalizations of the Kolmogorov-Barzdin embedding estimates
• Hadwiger's conjecture is true for almost every graph
• Minors in expanding graphs
• Minors in random regular graphs
• On the Hadwiger's conjecture for graph products
• On the separation profile of infinite graphs
• Randomly twisted hypercubes: between structure and randomness
• Recent progress in quantitative topology
• Thick embeddings of graphs into symmetric spaces via coarse geometry

This page was built for publication: Hypercube minor-universality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872460)