Infinite‐dimensional finitely forcible graphon

@article{Glebov2018InfinitedimensionalFF,
  title={Infinite‐dimensional finitely forcible graphon},
  author={Roman Glebov and Tereza Klimo{\vs}ov{\'a} and Daniel Kr{\'a}l},
  journal={Proceedings of the London Mathematical Society},
  year={2018},
  volume={118}
}
Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, that is, 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. Lovász 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… 
Compactness and finite forcibility of graphons
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely
Finitely forcible graphons with an almost arbitrary structure
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the
Finite forcibility and computability of graph limits
The theory of graph limits represents large graphs by an analytic object called a graphon. Graph limits determined by finitely many graph densities, which are represented by finitely forcible
Weak regularity and finitely forcible graph limits
TLDR
A finitely forcible graphon is constructed such that the number of parts in any weak $\varepsilon$-regular partition of $W$ is at least exponential in $\vrepsilon^{-2}/2^{5\log^*\varePSilon^-2}}$.
Extremal graph theory and finite forcibility
Elusive extremal graphs
TLDR
This paper presents a counterexample to Lovasz's conjecture that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph.
FROM GRAPH LIMITS TO HIGHER ORDER FOURIER ANALYSIS
The so-called graph limit theory is an emerging diverse subject at the meeting point of many different areas of mathematics. It enables us to view finite graphs as approximations of often more
On the boundary of the region defined by homomorphism densities
The Kruskal-Katona theorem together with a theorem of Razborov determine the closure of the set of points defined by the homomorphism density of the edge and the triangle in finite graphs. The

References

SHOWING 1-10 OF 86 REFERENCES
Compactness and finite forcibility of graphons
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely
Finitely forcible graphons
Finite forcibility and computability of graph limits
The theory of graph limits represents large graphs by an analytic object called a graphon. Graph limits determined by finitely many graph densities, which are represented by finitely forcible
Weak regularity and finitely forcible graph limits
TLDR
A finitely forcible graphon is constructed such that the number of parts in any weak $\varepsilon$-regular partition of $W$ is at least exponential in $\vrepsilon^{-2}/2^{5\log^*\varePSilon^-2}}$.
Regularity Partitions and The Topology of Graphons
TLDR
It is proved that if a graphon has an excluded induced sub-bigraph then the underlying metric space is compact and has finite packing dimension, which implies that such graphons have regularity partitions of polynomial size.
Elusive extremal graphs
TLDR
This paper presents a counterexample to Lovasz's conjecture that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph.
Flag algebras
TLDR
The first application of a formal calculus that captures many standard arguments in the area of asymptotic extremal combinatorics is given by presenting a new simple proof of a result by Fisher about the minimal possible density of triangles in a graph with given edge density.
Limits of dense graph sequences
...
...