An undecidability result on limits of sparse graphs

Endre Csóka

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…