Lassos: Pushing Tree Decompositions Forward Along Homomorphisms

TL;DR

This paper characterizes the class of surjective graph homomorphisms, specifically contractions, under which tree-width remains monotone when the decomposition shape is preserved, and introduces the concept of lassos for broader combinatorial structures.

Contribution

It proves that contractions are the only surjective homomorphisms preserving tree-width with fixed decomposition shape and introduces lassos as a new categorical tool for such analyses.

Findings

Contractions are uniquely monotone for tree-width under shape-preserving surjections.

Introduces lassos, a categorical generalization of contractions, applicable to various combinatorial structures.

Framework applicable to diverse data structures like hypergraphs and Petri nets.

Abstract

It is folklore that tree-width is monotone under taking subgraphs (i.e. injective graph homomorphisms) and contractions (certain kinds of surjective graph homomorphisms). However, although tree-width is obviously not monotone under any surjective graph homomorphism, it is not clear whether contractions are canonically the only class of surjections with respect to which it is monotone. Under the requirement that the decomposition shape must be preserved, we prove that this is indeed the case. Our results provide a framework for answering questions of this sort for many other kinds of combinatorial data structures (such as directed multigraphs, hypergraphs, Petri nets, circular port graphs, half-edge graphs, databases, simplicial sets etc.) for which natural analogues of tree decompositions can be defined. Furthermore and of independent interest, we prove these results by introducing the notion of a lasso, a generalization of contractions of graphs to arbitrary categories with pushouts of monomorphisms.