Weak convergence for rooted graphs excluding a finite set of minors
Weak convergence for rooted graphs excluding a finite set of minors
Let be a finite set of finite connected graphs, and let be the class of rooted, labelled or unlabelled, connected graphs with no minor in . Let be a uniformly random element of with vertices.
Rooted minor-exclusion convergence conjecture. The sequence converges weakly.
This is an early formulation of the paper's main question. The paper proves the analogous convergence for important special cases, including subcritical classes, while the general minor-closed case remains open in this formulation.
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.