Merge-models generalize twin-models to merge-width by representing binary structures as tree-ordered weakly sparse objects recoverable by first-order logic, with width bounds preserved from merge sequences and twin-width structures exactly characterized by loopless bounded merge-width merge-models.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On merge-models
Merge-models generalize twin-models to merge-width by representing binary structures as tree-ordered weakly sparse objects recoverable by first-order logic, with width bounds preserved from merge sequences and twin-width structures exactly characterized by loopless bounded merge-width merge-models.