Related papers: Distance from marker sequences in locally finite B…

A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…

The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET…

A graph $\Gamma$ is called locally finite if, for each vertex $v$ of $\Gamma$, the set $\Gamma(v)$ of all neighbors of $v$ in $\Gamma$ is finite. For any locally finite graph $\Gamma$ with vertex set $V(\Gamma)$ and for any field $F$, let…

For a field $F$ and a quadratic form $Q$ defined on an $n$-dimensional vector space $V$ over $F$, let $\mathrm{QG}_Q$, called the quadratic graph associated to $Q$, be the graph with the vertex set $V$ where vertices $u,w \in V$ form an…

In this note we make progress toward a conjecture of Durham--Fanoni--Vlamis, showing that every infinite-type surface with finite-invariance index 1 and no nondisplaceable compact subsurfaces fails to have a good curve graph, that is, a…

We generalize Brooks's theorem to show that if $G$ is a Borel graph on a standard Borel space $X$ of degree bounded by $d \geq 3$ which contains no $(d+1)$-cliques, then $G$ admits a $\mu$-measurable $d$-coloring with respect to any Borel…

As graphical summaries for topological spaces and maps, Reeb graphs are common objects in the computer graphics or topological data analysis literature. Defining good metrics between these objects has become an important question for…

A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…

Let $\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\Gamma$. If $\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard…

Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension, and also in higher dimensions if the map happens to be Markov. In general, the nonconformality of multidimensional intermittent maps represents a challenge that…

In this note we answer negatively to our conjecture concerning the deficiency indices. More precisely, given any non-negative integer $n$, there is locally finite graph on which the adjacency matrix has deficiency indices $(n,n)$.

We prove that every locally finite vertex-transitive graph $G$ admits a non-constant Lipschitz harmonic function.

We define the chromatic measure of a finite simple graph as the uniform distribution on its chromatic roots. We show that for a Benjamini-Schramm convergent sequence of finite graphs, the chromatic measures converge in holomorphic moments.…

Let $R$ be a finite ring and $r\in R$. The $r$-noncommuting graph of $R$, denoted by $\Gamma_R^r$, is a simple undirected graph whose vertex set is $R$ and two vertices $x$ and $y$ are adjacent if and only if $[x,y] \neq r$ and $-r$. In…

For smooth vector fields the classical method of characteristics provides a link between the ordinary differential equation and the corresponding continuity equation (or transport equation). We study an analog of this connection for merely…

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

Let $\mathcal{G} = \{G_1 = (V, E_1), \dots, G_m = (V, E_m)\}$ be a collection of $m$ graphs defined on a common set of vertices $V$ but with different edge sets $E_1, \dots, E_m$. Informally, a function $f :V \rightarrow \mathbb{R}$ is…

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

Let $f$ be a generically finite polynomial map $f: \mathbb{C}^n\to \mathbb{C}^m$ of algebraic degree $d$. Motivated by the study of the Jacobian Conjecture, we prove that the set $S_f$ of non-properness of $f$ is covered by parametric…