Compactness and finite forcibility of graphons

DOI10.4171/JEMS/901zbMath1422.05055arXiv1309.6695WikidataQ105319225 ScholiaQ105319225MaRDI QIDQ2327712

Jan Volec, Roman Glebov, Daniel Král'

Publication date: 15 October 2019

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

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

zbMATH Keywords

extremal combinatoricsgraph limits

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (6)

Finitely forcible graph limits are universal ⋮ Weak regularity and finitely forcible graph limits ⋮ Extremal graph theory and finite forcibility ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Finitely forcible graphons and permutons ⋮ Weak regularity and finitely forcible graph limits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A problem of Erdős and Sós on 3-graphs
• The clique density theorem
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• A new lower bound based on Gromov's method of selecting heavily covered points
• Monochromatic triangles in three-coloured graphs
• A note on the inducibility of 4-vertex graphs
• Testing properties of graphs and functions
• On the maximum number of five-cycles in a triangle-free graph
• A problem of Erdős on the minimum number of \(k\)-cliques
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Finitely forcible graph limits are universal
• On the number of pentagons in triangle-free graphs
• Finitely forcible graphons
• Quasirandom permutations are characterized by 4-point densities
• Moments of two-variable functions and the uniqueness of graph limits
• Rainbow triangles in three-colored graphs
• Generalized quasirandom graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Non-Three-Colourable Common Graphs Exist
• Graph limits and parameter testing
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Regularity partitions and the topology of graphons
• Hypergraphs Do Jump
• The number of cliques in graphs of given order and size
• A Solution to the 2/3 Conjecture
• Threshold Graph Limits and Random Threshold Graphs
• On the Minimal Density of Triangles in Graphs
• Weak regularity and finitely forcible graph limits
• A New Bound for the 2/3 Conjecture
• Decomposing Graphs into Edges and Triangles
• On the Density of Transitive Tournaments
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• Limits of Order Types
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Flag algebras
• Infinite‐dimensional finitely forcible graphon
• Counting flags in triangle-free digraphs
• Quasi-random graphs

This page was built for publication: Compactness and finite forcibility of graphons