Related papers: Geometric random graphs and Rado sets of continuou…
We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…
A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…
We highlight a topological aspect of the graph limit theory. Graphons are limit objects for convergent sequences of dense graphs. We introduce the representation of a graphon on a unique metric space and we relate the dimension of this…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
We construct a countable inductive limit of weighted Banach spaces of holomorphic functions, which is not a topological subspace of the corresponding weighted inductive limit of spaces of continuous functions. The main step of our…
A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…
It is well-known that a function on an open set in $\mathbb R^d$ is smooth if and only if it is arc-smooth, i.e., its composites with all smooth curves are smooth. In recent work, we extended this and related results (for instance, a real…
In this paper we consider bounded operators on infinite graphs, in particular Cayley graphs of amenable groups. The operators satisfy an equivariance condition which is formulated in terms of a colouring of the vertex set of the underlying…
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…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…
We study linear and algebraic structures in sets of bounded holomorphic functions on the ball which have large cluster sets at every possible point (i.e., every point on the sphere in several complex variables and every point of the closed…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…
Given a countable graph, we say a set $A$ of its vertices is \emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \emph{weakly universal} if it contains every finite graph as an induced subgraph. We show…
We analyze the disordered Riemannian geometry resulting from random perturbations of the Euclidean metric. We focus on geodesics, the paths traced out by a particle traveling in this quenched random environment. By taking the point of the…
Let (X, d) be a quasi-convex, complete and separable metric space with reference probability measure m. We prove that the set of of real valued Lipschitz function with non zero point-wise Lipschitz constant m-almost everywhere is residual,…
For a set $A\subset C[0,\infty)$, we give new results on the growth of the number of particles in a dyadic branching Brownian motion whose paths fall within A. We show that it is possible to work without rescaling the paths. We give large…
Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…