Finitely forcible graph limits are universal
From MaRDI portal
Publication:1621473
DOI10.1016/j.aim.2018.10.019zbMath1400.05124arXiv1701.03846OpenAlexW2616204030WikidataQ105319030 ScholiaQ105319030MaRDI QIDQ1621473
Daniel Král', Jacob W. Cooper, Taísa L. Martins
Publication date: 8 November 2018
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.03846
Related Items (6)
Cut distance identifying graphon parameters over weak* limits ⋮ Inducibility and universality for trees ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Extremal graph theory and finite forcibility ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Compactness and finite forcibility of graphons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 properties of graphs and functions
- On the maximum number of five-cycles in a triangle-free graph
- Limits of dense graph sequences
- 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
- On the number of pentagons in triangle-free graphs
- Finitely forcible graphons
- Compactness and finite forcibility of graphons
- Moments of two-variable functions and the uniqueness of graph limits
- 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
- Weak regularity and finitely forcible graph limits
- A New Bound for the 2/3 Conjecture
- Asymptotic Structure of Graphs with the Minimum Number of Triangles
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Flag algebras
- Infinite‐dimensional finitely forcible graphon
- Quasi-random graphs
This page was built for publication: Finitely forcible graph limits are universal
