Finitely forcible graphons

DOI10.1016/j.jctb.2011.03.005zbMath1223.05248arXiv0901.0929OpenAlexW1970138544MaRDI QIDQ2275893

László Lovász, Balázs Szegedy

Publication date: 10 August 2011

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.0929

zbMATH Keywords

graphonextremal graphgraph limitfinitely forcible graphon

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)

Related Items

Finitely forcible graph limits are universal ⋮ Quasirandom permutations are characterized by 4-point densities ⋮ Weak regularity and finitely forcible graph limits ⋮ On the density of a graph and its blowup ⋮ Decomposition of tournament limits ⋮ Multipodal structure and phase transitions in large constrained graphs ⋮ Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics ⋮ From quasirandom graphs to graph limits and graphlets ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ Graphon convergence of random cographs ⋮ Quasirandom Latin squares ⋮ Extremal graph theory and finite forcibility ⋮ Graph limits and hereditary properties ⋮ The phases of large networks with edge and triangle constraints ⋮ Typical large graphs with given edge and triangle densities ⋮ Subgraph densities in Markov spaces ⋮ Existence of a symmetric bipodal phase in the edge-triangle model ⋮ Phase transitions in finite random networks ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Limits of kernel operators and the spectral regularity lemma ⋮ Finitely forcible graphons and permutons ⋮ Semantic limits of dense combinatorial objects ⋮ Modularity spectra, eigen-subspaces, and structure of weighted graphs ⋮ Quasi-random words and limits of word sequences ⋮ Weak regularity and finitely forcible graph limits ⋮ Higher-order fluctuations in dense random graph models ⋮ Compactness and finite forcibility of graphons ⋮ Singularities in the entropy of asymptotically large simple graphs ⋮ Differential calculus on graphon space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• Complement reducible graphs
• Moments of two-variable functions and the uniqueness of graph limits
• On extreme points of convex sets
• Generalized quasirandom graphs
• Regularity partitions and the topology of graphons
• Threshold Graph Limits and Random Threshold Graphs
• On the Minimal Density of Triangles in Graphs
• Contractors and connectors of graph algebras
• Graph Classes: A Survey
• Flag algebras
• Extreme Points of Vector Functions
• Quasi-random graphs

This page was built for publication: Finitely forcible graphons