The sparsifying-transduction characterization of dense class properties
The sparsifying-transduction characterization of dense class properties
Let be a class of TOWS graphs, and let be the class obtained by the paper's sparsifying transduction. Let be a downset of weakly sparse class properties: if and is a weakly sparse transduction of , then . Define the dense analogue by requiring every weakly sparse transduction of to belong to . Sparsifying-transduction conjecture. For every class of TOWS graphs,
This would transfer every downclosed weakly sparse class property to its dense analogue through ; 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.