Related papers: Differential calculus on the space of countable la…
A `discrete differential manifold' we call a countable set together with an algebraic differential calculus on it. This structure has already been explored in previous work and provides us with a convenient framework for the formulation of…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…
In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space $|D|$ formed by a digraph $D$ together with its ends and limit edges. We then characterise those digraphs…
In a quantum mechanical treatment of gauge theories (including general relativity), one is led to consider a certain completion, $\agb$, of the space $\ag$ of gauge equivalent connections. This space serves as the quantum configuration…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…
Given a graph $G$, a \textit{$k$-total difference labeling} of the graph is a total labeling $f$ from the set of edges and vertices to the set $\{1, 2, \cdots k\}$ satisfying that for any edge $\{u,v\}$, $f(\{u,v\})=|f(u)-f(v)|$. If $G$ is…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
We study an analogue of the classical moment problem in the framework where moments are indexed by graphs instead of natural numbers. We study limit objects of graph sequences where edges are labeled by elements of a topological space.…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional analytic framework provides a universal language for various…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
In this paper, Lusternik-Schinrelmann and geometric category of finite spaces are considered. We define new numerical invariants of these spaces derived from the geometric category and present an algorithmic approach for its effective…