A　conjecture　akin　to　Hadwiger＇s　conjecture　posits　that　every　graph　G　contains　an　immersion　of　the　complete　graph　Kχ(G).　Vergara　showed　that,　for　every　n-vertex　graph　G　with　independence　number　two,　this　is　equivalent　to　saying　that　G　contains　an　immersion　of　the　complete　graph　on　[Formula　presented]　vertices.　Recently,　Botler　et　al.　showed　that　every　n-vertex　graph　G　with　α(G)=2　contains　every　complete　bipartite　graph　on　[Formula　presented]　vertices　as　an　immersion.　In　this　paper,　we　give　a　much　simpler　proof　of　this　result.　©　2025　Elsevier　B.V.