pith. sign in

arxiv: 1403.3049 · v1 · pith:XZY3FLEUnew · submitted 2014-03-12 · 🧮 math.CO · cs.DM

First order convergence and roots

classification 🧮 math.CO cs.DM
keywords convergencefirstgraphsorderverticesrootedsequencealmost
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.