Weak regularity and finitely forcible graph limits
From MaRDI portal
Publication:322209
DOI10.1016/j.endm.2015.06.021zbMath1346.05241arXiv1507.00067OpenAlexW2964351203WikidataQ57601343 ScholiaQ57601343MaRDI QIDQ322209
Tomáš Kaiser, Jacob W. Cooper, Daniel Král', Jonathan A. Noel
Publication date: 14 October 2016
Full work available at URL: https://arxiv.org/abs/1507.00067
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)
Related Items (1)
Cites Work
- Unnamed Item
- Szemerédi's lemma for the analyst
- Quick approximation to matrices and applications
- Bounds for graph regularity and removal lemmas
- Finitely forcible graphons
- Compactness and finite forcibility of graphons
- Moments of two-variable functions and the uniqueness of graph limits
- Infinite‐dimensional finitely forcible graphon
This page was built for publication: Weak regularity and finitely forcible graph limits