Related papers: Ultrametrics and complete multipartite graphs

We study Graev ultra-metrics which were introduced by Gao. We show that the free non-archimedean balanced topological group defined over an ultra-metric space is metrizable by a Graev ultra-metric. We prove that the Graev ultra-metric has a…

The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…

The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…

A hypergraph is \textit{bipartite with bipartition $(A, B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number…

For a finite simple graph $G$, say $G$ is of dimension $n$, and write $\dim(G) = n$, if $n$ is the smallest integer such that $G$ can be represented as a unit-distance graph in $\mathbb{R}^n$. Define $G$ to be \emph{dimension-critical} if…

This paper demonstrates that every ultrametric space is homeomorphic to a clade space of a pruned tree, i.e., a subspace of a tree's canopy. Furthermore, it characterizes several topological properties of ultrametrizable spaces through the…

The line generated by two distinct points, $x$ and $y$, in a finite metric space $M=(V,d)$, denoted by $\overline{xy}^M$, is the set of points given by $$\overline{xy}^M:=\{z\in V: d(x,y)=|d(x,z)\pm d(z,y)|\}.$$ A 2-set $\{x,y\}$ such that…

We obtain several new characterizations of ultrametric spaces in terms of roundness, generalized roundness, strict p-negative type, and p-polygonal equalities (p > 0). This allows new insight into the isometric embedding of ultrametric…

In this work we show that any connected locally connected graph defines a metric space having at least as many lines as vertices with only three exception: the complete multipartite graphs $K_{1,2,2}$, $K_{2,2,2}$ and $K_{2,2,2,2}$. This…

Given a metric space $(X,d)$, a set $S\subseteq X$ is called a $k$-\emph{metric generator} for $X$ if any pair of different points of $X$ is distinguished by at least $k$ elements of $S$. A $k$-\emph{metric basis} is a $k$-metric generator…

Let $(X, d)$ be an unbounded metric space. To investigate the asymptotic behavior of $(X, d)$ at infinity, one can consider a sequence of rescaling metric spaces $(X, \frac{1}{r_n} d)$ generated by given sequence $(r_n)_{n \in \mathbb N}$…

Let $(X, d)$ be a compact metric space and let $\mathcal{M}(X)$ denote the space of all finite signed Borel measures on $X$. Define $I \colon \mathcal{M}(X) \to \R$ by \[I(\mu) = \int_X \int_X d(x,y) d\mu(x) d\mu(y),\] and set $M(X) = \sup…

We describe some Cartesian products of metric spaces and find conditions under which products of ultrametric spaces are ultrametric.

In this paper, we construct two infinite families of graphs $G(d,c)$ and $G^+(d,c)$, where, in both cases, a vertex label is $x_1x_2\ldots x_c$ with $x_i\in\{1,2,\ldots, d\}$. We provide a lower bound on the metric dimension, tight on…

The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…

In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…

In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…

A metric space $(X,d)$ is called a $subline$ if every 3-element subset $T$ of $X$ can be written as $T=\{x,y,z\}$ for some points $x,y,z$ such that $d(x,z)=d(x,y)+d(y,z)$. By a classical result of Menger, every subline of cardinality $\ne…

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…

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…