An undecidability result on limits of sparse graphs

Details An undecidability result on limits of sparse graphs An undecidability result on limits of sparse graphs

2011-08-25

arxiv.org/abs/1108.4995v3

Mathematics

Combinatorics

6 pages

Scientific paper

Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (G_i) of finite bounded degree graphs such that the rooted r-radius neighbourhood of a random node of G_i is isomorphic to a rooted graph in B with probability tending to 1. Our proof implies a similar result for the case where the sequence (G_i) is replaced by a unimodular random graph.

Affiliated with

Also associated with

No associations

Rating

An undecidability result on limits of sparse graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An undecidability result on limits of sparse graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An undecidability result on limits of sparse graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318527