Strong-product immersion conjecture
Strong-product immersion conjecture
From papers
Let and be graphs, and write and . Strong-product immersion conjecture. Then
This conjecture is motivated by the identity 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
Sign in to submit a solution.
No solutions have been posted yet.