A subset $ S $ of vertices of a graph $ G $ is a\emph {general position set} if no shortest path
in $ G $ contains three or more vertices of $ S $. In this paper, we generalise a problem of M …

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átal conjectured that this holds for …

In a metric space M=(X, d), a line induced by two distinct points x, x′∈ X, denoted by, is the
set of points given by A line is universal whenever. Chen and Chvátal [Disc. Appl. Math. 156 …

A classical theorem of Euclidean geometry asserts that any noncollinear set of n points in
the plane determines at least n distinct lines. Chen and Chvátal conjectured a generalization …

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átal conjectured that this theorem extends …

A special case of a combinatorial theorem of De Bruijn and Erdős asserts that every
noncollinear set of n points in the plane determines at least n distinct lines. Chen and …

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átal asked whether the same statement holds …

A well-known theorem of de Bruijn and Erdős states that any set of n non-collinear points in
the plane determines at least n lines. Chen and Chvátal asked whether an analogous …

It is a classic result that a set of n non-collinear points in the Euclidean plane defines at least
n different lines. Chen and Chvátal conjectured in 2008 that the same results is true in metric …

In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can
be partitioned into three stable sets with two of them inducing a complete bipartite graph. We …