Notice
This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/134018.2
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
Author(s)
Sah, Ashwin; Sawhney, Mehtaab; Tidor, Jonathan; Zhao, Yufei
DownloadSubmitted version (119.0Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
© The Author(s), 2021. Published by Cambridge University Press. Bollobás and Riordan, in their paper 'Metrics for sparse graphs', proposed a number of provocative conjectures extending central results of quasirandom graphs and graph limits to sparse graphs. We refute these conjectures by exhibiting a sequence of graphs with convergent normalized subgraph densities (and pseudorandom C4-counts), but with no limit expressible as a kernel.
Date issued
2021Journal
Combinatorics Probability and Computing
Publisher
Cambridge University Press (CUP)