Immersions of large cliques in graphs with independence number 2 and bounded maximum degree

Fábio Botler, Cristina G. Fernandes, Carla N. Lintzmayer +4

An immersion of a graph $H$ in a graph $G$ is a minimal subgraph $I$ of $G$ for which there is an injection $\mathrm{i}:V(H)\to V(I)$ and a set of edge-disjoint paths $\{P_e:…