Constructing graphs with no immersion of large complete graphs

Karen L. Collins, Megan E. Heenehan

In 1989, Lescure and Meyniel proved, for $d=5,6$, that every $d$-chromatic graph contains an immersion of $K_d$, and in 2003 Abu-Khzam and Langston conjectured that this holds for…