A vertex subset R of a graph G is called a general position set if any triple V 0⊆ R is non-
geodesic, this is, the three elements of V 0 do not lie on the same geodesic in G. The …

The paper introduces a graph theory variation of the general position problem: given a
graph in terms of different isometric covers are given and used to determine the gp-number …

A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a
geodesic between two other vertices of S. The cardinality of a largest general position set of …

A vertex subset $ S $ of a graph $ G $ is a general position set of $ G $ if no vertex of $ S $
lies on a geodesic between two other vertices of $ S $. The cardinality of a largest general …

The general position number gp (G) of a connected graph G is the cardinality of a largest set
S of vertices such that no three distinct vertices from S lie on a common geodesic; such sets …

The general position problem is to find the cardinality of the largest vertex subset S such that
no triple of vertices of S lies on a common geodesic. For a connected graph G, the …

Given a graph G, the (graph theory) general position problem is to find the maximum number
of vertices such that no three vertices lie on a common geodesic. This graph invariant is …

Let $\alpha (\mathbb {F} _q^ d, p) $ denote the maximum size of a general position set in a $
p $-random subset of $\mathbb {F} _q^ d $. We determine the order of magnitude of $\alpha …

A note on the no-three-in-line problem on a torus - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Let ZZ be the set of integers and Z _l Z l be the set of integers modulo l. A set L ⊆ T= Z _ l_1
* Z _ l_2 * ⋯ * Z_ l_m L⊆ T= Z l 1× Z l 2×⋯× Z lm is called a line if there exist a, b ∈ T a, b∈ …