Forcing clique immersions through chromatic number

Building on recent work of Dvořák and Yepremyan, we show that every simple graph of minimum degree 7t+7 contains Kt as an immersion and that every graph with chromatic number at least 3.54t+4 contains Kt as an immersion.