Related papers: Lines in metric spaces: universal lines counted wi…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

Let F(X) be the set of finite nonempty subsets of a set X. We have found the necessary and sufficient conditions under which for a given function f:F(X)-->R there is an ultrametric on X such that f(A)=diam A for every A\in F(X). For finite…

\"{O}zavsar and Cevikel(Fixed point of multiplicative contraction mappings on multiplicative metric space.arXiv:1205.5131v1 [math.GN] 23 may 2012)initiated the concept of the multiplicative metric space in such a way that the usual…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

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…

In this work we present a version of the so called Chen and Chv\'atal's conjecture for directed graphs. A line of a directed graph D is defined by an ordered pair (u, v), with u and v two distinct vertices of D, as the set of all vertices w…

We address pairs $(X, Y)$ of metric spaces with the following property: for every mapping $f: X \to Y$ the existence of points $x, y \in X$ with $d(f(x),f(y)) > d(x,y)$ implies the existence of $\widetilde{x}, \widetilde{y}\in X$ for which…

Metric spaces $(X, d)$ are ubiquitous objects in mathematics and computer science that allow for capturing (pairwise) distance relationships $d(x, y)$ between points $x, y \in X$. Because of this, it is natural to ask what useful…

A metric space $(M, d)$ is said to be universal for a class of metric spaces if all metric spaces in the class can be isometrically embedded into $(M, d)$. In this paper, for a metrizable space $Z$ possessing abundant subspaces, we first…

We show, following W. Holsztynski, that there exists a continuous metric d on the set of real numbers R such that any finite metric space is isometrically embeddable into (R,d).

Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…

We consider bounded 2-metric spaces satisfying an additional axiom, and show that a contractive mapping has either a fixed point or a fixed line.

In this paper we provide several \emph{metric universality} results. We exhibit for certain classes $\cC$ of metric spaces, families of metric spaces $(M_i, d_i)_{i\in I}$ which have the property that a metric space $(X,d_X)$ in $\cC$ is…

In this survey we present a generalization of the notion of metric space and some applications to discrete structures as graphs, ordered sets and transition systems. Results in that direction started in the middle eighties based on the…

One of the most important and useful examples in discrete geometry is a finite sequence of points on the moment curve $\gamma(t)=(t,t^2,t^3,\dots ,t^d)$ or, more generally, on a {\it strictly monotone curve} in $\mathbb R^d$. These…

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

For a metrizable space $X$, we denote by $\mathrm{Met}(X)$ the space of all metric that generate the same topology of $X$. The space $\mathrm{Met}(X)$ is equipped with the supremum distance. In this paper, for every strongly…

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…

Given a metric space $(X, \rho)$, we say $y$ is between $x$ and $z$ if $\rho(x,z) = \rho(x,y) + \rho(y,z)$. A metric space gives rise to a 3-uniform hypergraph that has as hyperedges those triples $\{ x,y,z \}$ where $y$ is between $x$ and…

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…