F. BotlerJiménez, AndreaAndreaJiménezC.N. LintzmayerA. PastineQuiroz, DanielDanielQuirozM. Sambinelli2025-12-062025-12-062024-08-1210.1016/j.ejc.2024.1040422-s2.0-85201008534https://cris-uv-2.scimago.es/handle/123456789/7129WOS:001295477900001The analogue of Hadwiger's conjecture for the immersion relation states that every graph G contains an immersion of Kχ(G). For graphs with independence number 2, this is equivalent to stating that every such n-vertex graph contains an immersion of K⌈n/2⌉. We show that every n-vertex graph with independence number 2 contains every complete bipartite graph on ⌈n/2⌉ vertices as an immersion.enacceso restringidoComputational Theory And MathematicsDiscrete Mathematics And CombinatoricsGeometry And TopologyMathematicsTheoretical Computer Sciencearticle