First-Order Convergence and Roots

From MaRDI portal
Publication:5366887

DOI10.1017/S0963548315000048zbMATH Open1402.03058arXiv1403.3049OpenAlexW2115425636WikidataQ57601317 ScholiaQ57601317MaRDI QIDQ5366887FDOQ5366887


Authors: Demetres Christofides, Daniel Král' Edit this on Wikidata


Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: Nesetril and Ossona de Mendez introduced the notion of first order convergence, which unifies the notions of convergence for sparse and dense graphs. They asked whether if G_i is a sequence of graphs with M being their first order limit and v is a vertex of M, then there exists a sequence v_i of vertices such that the graphs G_i rooted at v_i converge to M rooted at v. We show that this holds for almost all vertices v of M and we give an example showing that the statement need not hold for all vertices.


Full work available at URL: https://arxiv.org/abs/1403.3049




Recommendations



Cites Work


Cited In (3)





This page was built for publication: First-Order Convergence and Roots

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