Sparsification of monadically stable classes

Prove that every monadically stable graph class is structurally nowhere dense.

Background

A structurally nowhere dense class is FO-transducible from a nowhere dense class. Since nowhere dense classes are monadically stable and monadic stability is preserved by transductions, structural nowhere denseness is contained in monadic stability. The conjecture asks whether this containment is an equality.

References

Could those notions actually coincide? This is the question asked in the following {\em{Sparsification Conjecture}.

Graph classes through the lens of logic  (2501.04166 - Pilipczuk, 7 Jan 2025) in Conjecture 5.1, Section 5.1