MSO limit laws for unlabelled addable minor-closed classes
Let be an addable, minor-closed class and let be its corresponding collection of unlabelled graphs. Let be a uniformly random connected unlabelled graph from , and let be a uniformly random unlabelled graph from . Unlabelled MSO limit-law conjecture. The random connected graph obeys the -zero-one law, and obeys the -convergence law. The paper strongly expects the labelled results for addable classes to extend to the unlabelled setting, but no proof is supplied.
References
- Peter Heinig, Tobias Muller, Marc Noy and Anusch Taraz, “Logical limit laws for minor-closed classes of graphs”, arXiv:1401.7021 (2018).
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.