Infinite-dimensional finitely forcible graphon
From MaRDI portal
Abstract: Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various problems in extremal combinatorics and theoretical computer science. Lovasz and Szegedy conjectured that the topological space of typical vertices of a finitely forcible graphon always has finite dimension, which would have implications on the minimum number of parts in its weak eps-regular partition. We disprove the conjecture by constructing a finitely forcible graphon with the space of typical vertices that has infinite dimension.
Recommendations
Cited in
(8)- Finitely forcible graph limits are universal
- Extremal graph theory and finite forcibility
- Infinite graphical Frobenius representations
- Finitely forcible graphons
- Compactness and finite forcibility of graphons
- Weak regularity and finitely forcible graph limits
- Finitely forcible graphons and permutons
- Finitely forcible graphons with an almost arbitrary structure
This page was built for publication: Infinite-dimensional finitely forcible graphon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741849)