Weak knitwork immersion conjecture for bounded-treewidth classes

From papers

Let k,d,1k,d,\ell\geq 1, let Δ2N\Delta\in 2\mathbb{N}, and let Ω=(V(Ω),)\Omega=(V(\Omega),\preceq) be a well-quasi-order. Let T(k,d,Δ,;Ω)\mathbf{T}(k,d,\Delta,\ell;\Omega) denote the class of Ω\Omega-knitworks defined in the paper, with the indicated parameters. Let Ω\Omega-knitwork immersion be the immersion relation on these objects that respects the quasi-order Ω\Omega.

Weak knitwork immersion conjecture. The class T(k,d,Δ,;Ω)\mathbf{T}(k,d,\Delta,\ell;\Omega) is well-quasi-ordered by Ω\Omega-knitwork immersion.

This conjecture removes the strongness requirement from the corresponding negative result for one unbounded-degree vertex and is intended as a positive complement to that obstruction. The supplied text gives no resolution.

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

Dario Cavallaro, Ken-ichi Kawarabayashi and Stephan Kreutzer, “Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width”, arXiv:2605.07468 (2026).

Solutions 0

No solutions have been posted yet.