Related papers: The Chen-Chv\'atal conjecture for metric spaces in…

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…

De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chv\'atal suggested a possible generalization of this theorem in the framework of metric spaces. We provide…

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 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…

In 2008, Chen and Chv\'atal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The…

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 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…

A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chv\'atal conjectured in 2008 that a similar result can be achieved in the broader context of finite metric spaces. This conjecture…

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…

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'atal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, this…

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…

De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. We suggest a possible generalization of this theorem in the framework of metric spaces and provide partial results on…

In 2008 Chen and Chv\'atal conjectured that any metric space on n points has at least n lines, unless all the points belong to one line. Chv\atal proved in 2014 that this is indeed the case for metric spaces with distances 0, 1 and 2. In…

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…

A well-known theorem in plane geometry 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 metric spaces,…

Chen and Chv\'atal conjectured in 2008 that in any finite metric space either there is a line containing all the points - a universal line -, or the number of lines is at least the number of points. This is a generalization of a classical…

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…

A graph $G=(V,E)$ is distance hereditary if every induced path of $G$ is a shortest path. In this paper, we show that the eccentricity function $e(v)=\max\{d(v,u): u\in V\}$ in any distance-hereditary graph $G$ is almost unimodal, that is,…