Related papers: Capacity of infinite graphs over non-Archimedean o…
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…
We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…
We consider operators arising from regular Dirichlet forms with vanishing killing term. We give bounds for the bottom of the (essential) spectrum in terms of exponential volume growth with respect to an intrinsic metric. As special cases we…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We prove crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of non-crossing geometric graphs that can be…
A graph $G$ is terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound…
We investigate properties of spectrum of normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for first non-zero eigenvalue. Then we describe properties of the operator…
Recently, connections have been explored between the complexity of finite problems in graph theory and the complexity of their infinite counterparts. As is shown in our paper (and in independent work of Tirza Hirst and D. Harel from a…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
The aim of this paper is that of discussing Closed Graph Theorems for bornological vector spaces in a way which is accessible to non-experts. We will see how to easily adapt classical arguments of functional analysis over $\mathbb{R}$ and…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
We investigate the validity of the Phragm\`en-Lindel\"of principle for a class of elliptic equations with a potential, posed on infinite graphs. Consequently, we get uniqueness, in the class of solutions satisfying a suitable growth…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex…
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how the richness of such interactions trades off…
In this note we study Shannon capacity of channels in the context of classical Ramsey numbers. We overview some of the results on capacity of noisy channels modelled by graphs, and how some constructions may contribute to our knowledge of…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
Two classical upper bounds on the Shannon capacity of graphs are the $\vartheta$-function due to Lov\'asz and the minrank parameter due to Haemers. We provide several explicit constructions of $n$-vertex graphs with a constant…
We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…