Weak convergence for rooted graphs excluding a finite set of minors
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.