The sparsifying-transduction characterization of dense class properties

Let C\mathscr C be a class of TOWS graphs, and let Sp(C)\mathsf{Sp}(\mathscr C) be the class obtained by the paper's sparsifying transduction. Let ΠS\Pi_S be a downset of weakly sparse class properties: if CΠS\mathscr C\in\Pi_S and D\mathscr D is a weakly sparse transduction of C\mathscr C, then DΠS\mathscr D\in\Pi_S. Define the dense analogue Π\Pi by requiring every weakly sparse transduction of C\mathscr C to belong to ΠS\Pi_S. Sparsifying-transduction conjecture. For every class C\mathscr C of TOWS graphs,

CΠ    Sp(C)ΠS.\mathscr C\in\Pi\qquad\iff\qquad\mathsf{Sp}(\mathscr C)\in\Pi_S.

This would transfer every downclosed weakly sparse class property to its dense analogue through Sp\mathsf{Sp}; the supplied text gives no resolution status.

Sources & referencesView supporting material

Primary source

Hector Buffière, Yuquan Lin, Jaroslav Nešetřil, Patrice Ossona de Mendez and Sebastian Siebertz, “Characterizations of monadically dependent tree-ordered weakly sparse structures”, arXiv:2601.16039 (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.