A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
نویسندگان
چکیده
Abstract Bollobás and Riordan, in their paper ‘Metrics for sparse graphs’, proposed a number of provocative conjectures extending central results quasirandom graphs graph limits to graphs. We refute these by exhibiting sequence with convergent normalized subgraph densities (and pseudorandom C 4 -counts), but no limit expressible as kernel.
منابع مشابه
A counterexample to sparse removal
The Turán number of a graph H, denoted ex(n,H), is the maximum number of edges in an n-vertex graph with no subgraph isomorphic to H. Solymosi [17] conjectured that if H is any graph and ex(n,H) = O(n) where α > 1, then any n-vertex graph with the property that each edge lies in exactly one copy of H has o(n) edges. This can be viewed as conjecturing a possible extension of the removal lemma to...
متن کاملA counterexample to a result on the tree graph of a graph
Given a set of cycles C of a graph G, the tree graph of G, defined by C, is the graph T (G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if R∪S contains exactly one cycle and this cycle lies in C. Li et al. [Discrete Math. 271 (2003), 303–310] proved that if the graph T (G,C) is connected, then C cyclically spans the cycle space of G. Later, Yumei Hu ...
متن کاملA note on a graph related to the comaximal ideal graph of a commutative ring
The rings considered in this article are commutative with identity which admit at least two maximal ideals. This article is inspired by the work done on the comaximal ideal graph of a commutative ring. Let R be a ring. We associate an undirected graph to R denoted by mathcal{G}(R), whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R), where J(R) is...
متن کاملA counterexample to the pseudo 2-factor isomorphic graph conjecture
A graph G is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of G. Abreu et al. [1] conjectured that K3,3, the Heawood graph and the Pappus graph are the only essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graphs (Abreu et al., Journal of Combinatorial Theory, Series B, 2008, Conjecture 3.6). Using a computer ...
متن کاملA Counterexample to Conjectures by Sloane and Erdős concerning the Persistence of Numbers
If the digits of any multi-digit number are multiplied together, another number results. If this process is iterated, eventually a single digit number will be produced. The number of steps that this process takes, before a single digit number is obtained, is referred to as the persistence of the of the original number [5]. Neil Sloane conjectured that for any base b, there is a number c(b) such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability & Computing
سال: 2021
ISSN: ['0963-5483', '1469-2163']
DOI: https://doi.org/10.1017/s0963548321000031