This is not the latest version of this item. The latest version can be found here.
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
Name
2003.05272.pdf
Description
Submitted version
Size
119.03 KB
Format
Adobe PDF
Checksum (MD5)
318bf974b34fb6dce01f403dc64e0a17
Author(s) • • •
Sah, Ashwin
Sawhney, Mehtaab
Tidor, Jonathan
Zhao, Yufei
Date Issued
2021
Journal
Combinatorics Probability and Computing
Publisher
Cambridge University Press (CUP)
Version
Original manuscript
Abstract
© 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.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
10.1017/S0963548321000031