Related papers: Ultrametrics and complete multipartite graphs

Let $WS(X, d)$ be the class of ultrametric spaces which are weakly similar to ultrametric space $(X, d)$. The main results of the paper completely describe the ultrametric spaces $(X, d)$ for which the equality $$ \rho(x, y) = f(d(\Phi(x),…

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

A metric space $X$ is rigid if the isometry group of $X$ is trivial. The finite ultrametric spaces $X$ with $|X| \geq 2$ are not rigid since for every such $X$ there is a self-isometry having exactly $|X|-2$ fixed points. Using the…

The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…

A graph $X$ is said to be {\it distance--balanced} if for any edge $uv$ of $X$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. A graph $X$ is said to be {\it strongly…

Let $X\subset A^{Z^d}$ be a $2$-dimensional subshift of finite type. We prove that any $2$-dimensional multidimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…

The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…

For a cardinal $\kappa > \omega$ a metric space $X$ is called to be $\kappa$-superuniversal whenever for every metric space $Y$ with $|Y| < \kappa$ every partial isometry from a subset of $Y$ into $X$ can be extended over the whole space…

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

There exists a completely metrizable bounded metrizable space $X$ with compatible metrics $d,d'$ so that the hyperspace $CL(X)$ of nonempty closed subsets of $X$ endowed with the Hausdorff metric $H_d$, $H_{d'}$, resp. is…

Following a review of metric, ultrametric and generalized ultrametric, we review their application in data analysis. We show how they allow us to explore both geometry and topology of information, starting with measured data. Some themes…

We first prove that for every metrizable space $X$, for every closed subset $F$ whose complement is zero-dimensional, the space $X$ can be embedded into a product space of the closed subset $F$ and a metrizable zero-dimensional space as a…

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

A number of topics involving metrics and measures are discussed, including some of the special structure associated with ultrametrics.