Elsevier

Discrete Mathematics

Volume 340, Issue 10, October 2017, Pages 2589-2603
Discrete Mathematics

Limits of structures and the example of tree semi-lattices

https://doi.org/10.1016/j.disc.2017.06.013Get rights and content
Under an Elsevier user license
open archive

Abstract

The notion of left convergent sequences of graphs introduced by Lovász et al. (in relation with homomorphism densities for fixed patterns and Szemerédi’s regularity lemma) got increasingly studied over the past 10 years. Recently, Nešetřil and Ossona de Mendez introduced a general framework for convergence of sequences of structures. In particular, the authors introduced the notion of QF-convergence, which is a natural generalization of left-convergence. In this paper, we initiate study of QF-convergence for structures with functional symbols by focusing on the particular case of tree semi-lattices. We fully characterize the limit objects and give an application to the study of left convergence of m-partite cographs, a generalization of cographs.

Keywords

Graph limits
Structural limit
Random-free graphon
Tree-order
m-partite cograph

Cited by (0)