Related papers: Generic Compacta from Relations between Finite Gra…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…
Given any (not necessarily connected) combinatorial finite graph and any compact smooth $6$-manifold $M^6$ with the third Betti number $b_3\not=0$, we construct a calibrated 3-dimensional homologically area minimizing surface on $M$…
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
In this paper, we use elementary and simple ideas which are based on the significant applications of the power set ring to rebuild and study the patch topology on the prime spectrum from a completely different and new point of view.…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix…
The goal of this paper is to establish the fundamental tools to analyze signals defined over a topological space, i.e. a set of points along with a set of neighborhood relations. This setup does not require the definition of a metric and…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
A convenient bicategory of topological stacks is constructed which is both complete and Cartesian closed. This bicategory, called the bicategory of compactly generated stacks, is the analogue of classical topological stacks, but for a…