Lopez's path-transduction conjecture for non-2-well-quasi-ordered graph classes
Lopez's path-transduction conjecture for non-2-well-quasi-ordered graph classes
From papers
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.
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
Maël Dumas and Aliaume Lopez, “Well-quasi-ordered classes of bounded clique-width”, arXiv:2601.18571 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.