Lopez's path-transduction conjecture for non-2-well-quasi-ordered graph classes
Let be a hereditary class of finite graphs. Lopez's path-transduction conjecture. If is not -well-quasi-ordered, then existentially transduces the class of all finite paths. This conjecture proposes a logical obstruction to -well-quasi-ordering; it remains open in the general setting considered here.
References
Primary source
Maël Dumas and Aliaume Lopez, “Well-quasi-ordered classes of bounded clique-width”, arXiv:2601.18571 (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.