# Limits of Structures and the Example of Tree-Semilattices

2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemer\'edi's regularity lemma) got increasingly studied over the past $10$ years. Recently, Ne\v set\v ril 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 :
Document type :
Preprints, Working Papers, ...

https://hal.archives-ouvertes.fr/hal-01150659
Contributor : Patrice Ossona de Mendez <>
Submitted on : Thursday, September 17, 2015 - 8:22:20 AM
Last modification on : Wednesday, November 6, 2019 - 10:50:21 AM
Long-term archiving on : Wednesday, April 26, 2017 - 6:39:20 PM

### Files

tree_orders_15_05_07.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01150659, version 2
• ARXIV : 1505.03037

### Citation

Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez. Limits of Structures and the Example of Tree-Semilattices. 2015. ⟨hal-01150659v2⟩

Record views