Author:
Hartman David,Hons Tomáš,Nešetřil Jaroslav
Abstract
Structural convergence is a framework for convergence of graphs by Ne\v{s}et\v{r}il and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given sequence of graphs $(G_n)$ converging to a limit $L$ and a vertex $r$ of $L$ it is possible to find a sequence of vertices $(r_n)$ such that $L$ rooted at $r$ is the limit of the graphs $G_n$ rooted at $r_n$. A counterexample was found by Christofides and Kr\'{a}l', but they showed that the statement holds for almost all vertices $r$ of $L$. We offer another perspective to the original problem by considering the size of definable sets to which the root $r$ belongs. We prove that if $r$ is an algebraic vertex (i.e. belongs to a finite definable set), the sequence of roots $(r_n)$ always exists.
Reference12 articles.
1. Benjamini, I., & Schramm, O. (2001). Recurrence of Distributional Limits of Finite Planar Graphs. Electronic Journal of Probability, 6(none). https://doi.org/10.1214/ejp.v6-96
2. Borgs, C., Chayes, J., Lovász, L., Sós, V. T., & Vesztergombi, K. (2006). Counting Graph Homomorphisms. In Topics in Discrete Mathematics (pp. 315-371). Springer Berlin Heidelberg. https://doi.org/https://doi.org/10.1007/3-540-33700-8_18
3. Christofides, D., & Král', D. (2015). First-Order Convergence and Roots. Combinatorics, Probability and Computing, 25(2), 213-221. https://doi.org/10.1017/s0963548315000048
4. Elek, G. (2007). Note on limits of finite graphs. Combinatorica, 27(4), 503-507. https://doi.org/10.1007/s00493-007-2214-8
5. Hartman, D., Hons, T., & Nešetřil, J. (2022). Gadget construction and structural convergence. arXiv. https://doi.org/10.48550/ARXIV.2212.10985