@article{GKM21EXTstrongmodelinglimits,
  title={Strong modeling limits of graphs with bounded tree-width}, 
  author={Grzesik, Andrzej and Kr{\'a}{\v{l}}, Daniel and Mohr, Samuel},
  biburl = {http://samuel-mohr.de/files/bib/extabstr4.bib},
  note = {Eurocomb 2021},
  doi = {10.1007/978-3-030-83823-2_43},
  journal = {Extended Abstracts EuroComb 2021. Trends in Mathematics},
  volume = {14},
  year = {2021},
  abstract = {The notion of first order convergence of graphs unifies the notions of convergence for sparse and dense graphs.
Ne\v set\v ril and Ossona de Mendez \href{https://doi.org/10.1017/jsl.2018.32}{[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 Ne\v set\v ril and Ossona de Mendez \href{https://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v23i2p52/0}{[Electron. J. Combin. 23 (2016), P2.52]} and
for first order sequences of graphs with bounded path-width by Gajarsk\'y et al. \href{https://doi.org/10.1002/rsa.20676}{[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.}
}