Towards a Characterization of Universal Categories
J. Nesetril, P. Ossona de Mendez
TL;DR
The paper characterizes which monotone subcategories of finite graphs are algebraic universal, linking universality to the somewhere dense property via the sparse-dense dichotomy and model-theoretic tools. It proves an equivalence: a monotone subcategory K of Gra is universal (in the sense of embedding Gra or the simplicial category Delta via orientations) if and only if K is somewhere dense. The approach blends first-order interpretations with gadget constructions to show that somewhere dense classes yield universal orientation representations, clarifying the boundary between sparse and dense graph classes in the representation of concrete categories. The work thus provides a high-level, algebraic criterion for universality in the finite graph setting and highlights a sharp complexity gap between nowhere dense and somewhere dense regimes for representing broad algebraic structures.
Abstract
In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is based on the sparse--dense dichotomy and its model theoretic equivalent.