Immersions and Albertson's conjecture

Jacob Fox, Janos Pach, Andrew Suk

A graph is said to contain $K_k$ (a clique of size $k$) as a weak immersion if it has $k$ vertices, pairwise connected by edge-disjoint paths. In 1989, Lescure and Meyniel made the…