Strong modeling limits of graphs with bounded tree-width

arXiv2103.10354MaRDI QIDQ6505074FDOQ6505074

Authors: A. Grzesik, Daniel Král', S. Mohr 

Abstract: The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs. Nev{s}etv{r}il and Ossona de Mendez [J. Symbolic Logic 84 (2019), 452--472] proved that every first order convergent sequence of graphs from a nowhere-dense class of graphs has a modeling limit and conjectured the existence of such modeling limits with an additional property, the strong finitary mass transport principle. The existence of modeling limits satisfying the strong finitary mass transport principle was proved for first order convergent sequences of trees by Nev{s}etv{r}il and Ossona de Mendez [Electron. J. Combin. 23 (2016), P2.52] and for first order sequences of graphs with bounded path-width by Gajarsk'y et al. [Random Structures Algorithms 50 (2017), 612--635]. We establish the existence of modeling limits satisfying the strong finitary mass transport principle for first order convergent sequences of graphs with bounded tree-width.

This page was built for publication: Strong modeling limits of graphs with bounded tree-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505074)