Lovász–Szegedy finite-dimensionality conjecture for finitely forcible graphons
Lovász–Szegedy finite-dimensionality conjecture for finitely forcible graphons
A graphon is an analytic representation of the limit of a convergent sequence of dense graphs; a graphon is finitely forcible if it is uniquely determined, up to isomorphism, by finitely many graph densities. The space of typical vertices is the vertex space associated with a graphon and its graph-limit structure.
Lovász–Szegedy finite-dimensionality conjecture. The space of typical vertices of every finitely forcible graphon has finite dimension.
Lovász and Szegedy proposed this as a formalization of the expectation that finitely forcible graphons have a simple structure. The conjecture was disproved by counterexample constructions.
Sources & referencesView supporting material
Primary source
Jacob W. Cooper, Daniel Kral and Taisa L. Martins, “Finitely forcible graph limits are universal”, arXiv:1701.03846 (2018).
Additional references
4 papers in this index state this conjecture (2009–2017). The statement above is taken from the most recent of them; the others are arXiv:1507.00067, arXiv:1309.6695, arXiv:0902.0132.
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.