Strong-product immersion conjecture

From papers

Let GG and HH be graphs, and write im(G)=t\operatorname{im}(G)=t and im(H)=r\operatorname{im}(H)=r. Strong-product immersion conjecture. Then

im(GH)tr.\operatorname{im}(G\boxtimes H)\geq tr.

This conjecture is motivated by the identity KtKr=KtrK_t\boxtimes K_r=K_{tr} and the resulting immersion number of the strong product of complete graphs; the paper presents it as an unresolved conjecture.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Karen L. Collins, Megan E. Heenehan and Jessica McDonald, “Clique immersion in graph products”, arXiv:1908.10457 (2019).

Solutions 0

No solutions have been posted yet.