Skip to main navigation Skip to search Skip to main content

A counterexample to the Bollobás-Riordan conjectures on sparse graph limits

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)796-799
Number of pages4
JournalCombinatorics Probability and Computing
Volume30
Issue number5
DOIs
StatePublished - Sep 1 2021
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A counterexample to the Bollobás-Riordan conjectures on sparse graph limits'. Together they form a unique fingerprint.

Cite this