Direct-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. Direct-product immersion conjecture. Then

im(G×H)(t1)(r1)+1.\operatorname{im}(G\times H)\geq (t-1)(r-1)+1.

This conjecture asserts that the direct product preserves the proposed lower bound for immersion numbers; the paper gives partial results but does not resolve the general case.

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.