Monadically Dependent Graph Classes Have Almost Bounded Merge-Width
cs.DM, cs.DS, cs.LO, math.CO, math.LO
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- $\chi$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
- Variants of Merge-Width and Applications
- Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes
- Graph classes through the lens of logic
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns