Compactness and finite forcibility of graphons
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 many subgraph densities, which are referred to as finitely forcible. Following the intuition that such graphons should have finitary structure, Lovász and Szegedy …