Related papers: Finite type as fundamental objects even non-single…
Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…
In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash-Willian's Tree-Packing Theorem…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
This paper introduces indefinite proximities inherent in the collection of physical objects found in a dynamical system. Axiomatically, these indefinite proximities lead to a new form of Hausdorff topology, which is indefinite…
Motivated by the work of Cantwell-Conlon-Fenley on endperiodic homeomorphisms of infinite type surfaces, we define and study endperiodic and generalized endperiodic maps of an infinite graph with finitely many ends. Adapting the work of…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
We define a new family of graph invariants, studying the topology of the moduli space of their geometric realizations in Euclidean spaces, using a limiting procedure reminiscent of Floer homology. Given a labeled graph $G$ on $n$ vertices…
The main purpose of the paper is to establish a closedness theorem over Henselian valued fields $K$ of equicharacteristic zero (not necessarily algebraically closed) with separated analytic structure. It says that every projection with a…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
Directions of graphs were originally introduced in the study of a cops-and-robbers kind of game, while the study of end spaces has been used to generalize classical graph-theoretical results to infinite graphs, such as Halin's…
Let $\mathcal H$ be a finite connected undirected graph and $\mathcal H_{walk}$ be the graph of bi-infinite walks on $\mathcal H$; two such walks $\{x_i\}_{i\in \mathbb Z}$ and $\{y_i\}_{i \in \mathbb Z}$ are said to be adjacent if $x_i$ is…
In this paper we extend to an infinite dimensional setting some results on the shadowing property that are known on finite dimensional compact manifolds without border and in $\mathbb{R}^n$. In fact, we show that if $\{\T(t):t\ge 0\}$ is a…
We study the pants complex of surfaces of infinite type. When $S$ is a surface of infinite type, the usual definition of the pants graph $\mathcal{P}(S)$ yields a graph with infinitely many connected-components. In the first part of our…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
We consider self-similar continua possessing finite intersection property and prove intersection graph criterion for self-similar dendrites, finite order Theorem for such continua satisfying open set condition in $\mathbb{R}^n$ and…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…