Related papers: Compactness and finite forcibility of graphons

The structure of finite-area topological defects in graphene is described in terms of both the direct honeycomb lattice and its dual triangular lattice. Such defects are equivalent to cutting out a patch of graphene and replacing it with a…

The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence…

We show that an arbitrary infinite graph can be compactified by its ${\aleph_0}$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a…

Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the…

Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be…

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

We construct a locally finite connected graph whose Freudenthal compactification is universal for the class of completely regular continua, a class also known in the literature under the name thin or graph-like continua.

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

In a recent paper, Caron and Fox suggest a probabilistic model for sparse graphs which are exchangeable when associating each vertex with a time parameter in $\mathbb{R}_+$. Here we show that by generalizing the classical definition of…

Given a compact Riemannian manifold with boundary, we prove that the space of embedded, which may be improper, free boundary minimal hypersurfaces with uniform area and Morse index upper bound is compact in the sense of smoothly graphical…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…

Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity. This paper derives a theory of graphon signal processing centered on the notions of graphon…

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…