Related papers: A graphon counter example

The weak cop number of infinite graphs can be seen as a coarse-geometric analogue to the cop number of finite graphs. We show that every vertex transitive graph with at least one thick end has infinite weak cop number. It follows that every…

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…

The difference between the (squared) sides of the Grace-Danielsson inequality for tetrahedra will be represented as a sum of two nonnegative terms. This gives another proof of the inequality. Examining the denominator allows us to…

The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph…

The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…

An end of a graph $G$ is an equivalence class of rays, where two rays are equivalent if there are infinitely many vertex-disjoint paths between them in $G$. The degree of an end is the maximum cardinality of a collection of pairwise…

Thanks to recent advances in parametric geometry of numbers, we know that the spectrum of any set of $m$ exponents of Diophantine approximation to points in $\mathbb{R}^n$ (in a general abstract setting) is a compact connected subset of…

Motivated by the weak gravity conjecture, arXiv:2108.04594 conjectured that in any CFT, the minimal operator dimension at fixed charge is a convex function of the charge. In this letter we construct a counterexample to this convexity…

We study the behavior of the activity of the parallel chip-firing upon increasing the number of chips on an Erd\H{o}s--R\'enyi random graph. We show that in various situations the resulting activity diagrams converge to a devil's staircase…

By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Euler graphs with only one (two) type(s) of cycles under (mod 4) operation were studied in Part-I(II). Here we consider the class of Euler graphs with only three types of cycles under (mod 4). This gives rise to four cases viz., graphs…

We describe a program to construct a counterexample to the Deift conjecture, that is, an almost periodic function whose evolution under the KdV equation is not almost periodic in time. The approach is based on a dichotomy found by Volberg…

A $t$-nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly $t$ numbers of its faces have the same length. It is proved that there is no 2-connected $1$-nearly platonic graph. In this paper,…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

Consider a random graph process with $n$ vertices corresponding to points $v_{i} \sim {Unif}[0,1]$ embedded randomly in the interval, and where edges are inserted between $v_{i}, v_{j}$ independently with probability given by the graphon…

Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…

The scramble number of a graph provides a lower bound for gonality and an upper bound for treewidth, making it a graph invariant of interest. In this paper we study graphs of scramble number at most two, and give a classification of all…

Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…

A simplified construction is presented for Komj\'ath's result that for every uncountable cardinal $\kappa$, there are $2^\kappa$ graphs of size $\kappa$ none of them being a minor of another.