Weak regularity and finitely forcible graph limits

DOI10.1090/tran/7066zbMath1383.05167OpenAlexW2530575378MaRDI QIDQ4608759

Jonathan A. Noel, Tomáš Kaiser, Jacob W. Cooper, Daniel Král'

Publication date: 28 March 2018

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/tran/7066

zbMATH Keywords

graphonextremal graphgraph limitfinitely forcible graphon

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (5)

Cut distance identifying graphon parameters over weak* limits ⋮ Finitely forcible graph limits are universal ⋮ Quasirandom Latin squares ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Compactness and finite forcibility of graphons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Densities in large permutations and parameter testing
• 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
• Testing permutation properties through subpermutations
• Testing properties of graphs and functions
• On the maximum number of five-cycles in a triangle-free graph
• Limits of dense graph sequences
• On limits of finite graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On universality of graphs with uniformly distributed edges
• Quick approximation to matrices and applications
• Bounds for graph regularity and removal lemmas
• Limits of permutation sequences
• On the number of pentagons in triangle-free graphs
• Finitely forcible graphons
• Compactness and finite forcibility of graphons
• Quasirandom permutations are characterized by 4-point densities
• Moments of two-variable functions and the uniqueness of graph limits
• Poset limits and exchangeable random posets
• 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
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• A Solution to the 2/3 Conjecture
• Threshold Graph Limits and Random Threshold Graphs
• On the Minimal Density of Triangles in Graphs
• A New Bound for the 2/3 Conjecture
• Sparse graphs: Metrics and random models
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Flag algebras
• Quasi-random graphs

This page was built for publication: Weak regularity and finitely forcible graph limits