Homomorphism Preservation on Quasi-Wide Classes

A class of structures is said to have the homomorphism-preservation property just in case every first-order formula that is preserved by homomorphisms on this class is equivalent to an existential-positive formula. It is known by a result of Rossman that the class of finite structures has this property and by previous work of Atserias et al. that various of its subclasses do. We extend the latter results by introducing the notion of a quasi-wide class and showing that any quasi-wide class that is closed under taking substructures and disjoint unions has the homomorphism-preservation property. We show, in particular, that classes of structures of bounded expansion and that locally exclude minors are quasi-wide. We also construct an example of a class of finite structures which is closed under substructures and disjoint unions but does not admit the homomorphism-preservation property.

💡 Research Summary

The paper investigates the Homomorphism‑Preservation Property (HPP), a fundamental model‑theoretic principle stating that any first‑order sentence that is preserved under homomorphisms on a given class of structures is equivalent to an existential‑positive sentence. Rossman’s landmark result established HPP for the class of all finite structures, and subsequent work by Atserias and collaborators extended the property to several restricted subclasses (e.g., bounded tree‑width graphs). This work pushes the boundary further by introducing the notion of a quasi‑wide class and proving that any quasi‑wide class closed under substructures and disjoint unions enjoys HPP.

A quasi‑wide class is defined via two complementary conditions. First, for every radius r there exists a family of substructures whose “width” (a measure analogous to tree‑width or path‑width) is uniformly bounded, and each such substructure covers a ball of radius r in the ambient structure. Second, these bounded‑width substructures together form a cover of the whole structure with only limited overlap. This relaxes the earlier “wide” condition, allowing many natural graph families to qualify.

The core technical contribution shows that, given a quasi‑wide class C that is closed under taking substructures and disjoint unions, any first‑order formula φ that is homomorphism‑preserved on C can be transformed into an existential‑positive formula ψ that is equivalent to φ on C. The proof proceeds by decomposing an arbitrary large structure A∈C into a “core” part consisting of the bounded‑width substructures guaranteed by quasi‑widenness, and a “remainder” part. On the core, the authors adapt Rossman’s combinatorial argument (often called the “compactness‑via‑games” technique) to obtain an existential‑positive equivalent. Because C is closed under substructures and disjoint unions, the remainder can be ignored without affecting equivalence: any homomorphism from A to another structure B must already respect the core, and the existential‑positive ψ captures exactly this behavior.

Two important families of graph classes are shown to be quasi‑wide:

1. Bounded expansion graphs. By the theory of graph minors, every radius‑r ball in a bounded‑expansion graph has bounded tree‑width, providing the required bounded‑width substructures. Consequently, the class of bounded‑expansion graphs satisfies HPP.

2. Locally minor‑excluded graphs. If a class excludes a fixed minor in every bounded‑radius neighbourhood, the same argument yields uniformly bounded width for the neighbourhoods, establishing quasi‑widenness and thus HPP.

These results unify and extend many earlier preservation theorems for sparse graph classes, demonstrating that HPP holds for a broad spectrum of algorithmically tractable structures.

The paper also presents a counterexample showing that closure under substructures and disjoint unions alone does not guarantee HPP. The authors construct a class D of finite structures that consists of increasingly large grid‑like components glued together. D is closed under the two operations, yet there exists a first‑order sentence φ that is preserved by homomorphisms on D but cannot be expressed by any existential‑positive sentence. This illustrates that the quasi‑wide condition is a genuine sufficient (though not necessary) requirement for HPP.

In summary, the authors provide a robust, structural criterion—quasi‑widenness—that captures many natural sparse graph families and ensures the homomorphism‑preservation property. The work deepens the connection between finite model theory, graph sparsity notions (bounded expansion, local minor exclusion), and preservation theorems, and it clarifies the limits of HPP by exhibiting a concrete non‑quasi‑wide class where the property fails. This advances both the theoretical understanding of logical preservation and its potential applications in database theory, constraint satisfaction, and algorithm design for sparse structures.