Benjamini--Schramm convergence for graphs excluding a finite set of minors

Let S\mathcal S be a finite set of finite connected graphs, and let Ex(S)Ex(\mathcal S) be the class of labelled or unlabelled connected graphs with no minor in S\mathcal S. Let GnG_n be a uniformly random element of Ex(S)Ex(\mathcal S) with nn vertices.

Minor-exclusion Benjamini--Schramm conjecture. The sequence GnG_n Benjamini--Schramm converges.

The conjecture is the unrooted counterpart of the rooted weak-convergence question. The paper proves it for several subcritical families, but the general minor-closed case is not established here.

Sources & referencesView supporting material

Primary source

Agelos Georgakopoulos and Stephan Wagner, “Limits of subcritical random graphs and random graphs with excluded minors”, arXiv:1512.03572 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.