← All problems

Linear odd-colouring bound for complete-graph immersions

Less than 1 year old · traced to

Let GG be a graph and let G→odd⁡KctG\xrightarrow{\operatorname{odd}} K_{ct} mean that GG admits a t′t'-oddomorphism to KctK_{ct}, as defined in the source. Linear immersion conjecture. There exists an absolute constant cc such that if

G→odd⁡Kct,G\xrightarrow{\operatorname{odd}} K_{ct},

then GG contains a KtK_t-immersion.

The conjecture would improve the established bound (t2)(7t+7)\binom{t}{2}(7t+7) to a bound linear in tt. The source does not state whether it has been resolved.

References
  1. Andrea Jiménez, Benjamin Moore, Daniel A. Quiroz and Youngho Yoo, “Homomorphism counting for immersion-closed classes is not isomorphism”, arXiv:2602.08738 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.