Weak knitwork immersion conjecture for bounded-treewidth classes
Let , let , and let be a well-quasi-order. Let denote the class of -knitworks defined in the paper, with the indicated parameters. Let -knitwork immersion be the immersion relation on these objects that respects the quasi-order .
Weak knitwork immersion conjecture. The class is well-quasi-ordered by -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.
References
Primary source
Dario Cavallaro, Ken-ichi Kawarabayashi and Stephan Kreutzer, “Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width”, arXiv:2605.07468 (2026).
Progress summary
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.