讲座内容：

For aconnected graph G=(V(G), E(G)), a set S ⊆ V (G) is a general positionset if no three pairwise-distinct vertices from S lie on a common shortest pathin G. The general position number (or gp-number for short) gp(G) of G is thecardinality of a largest general position set of G. In this talk we will surveysome recent results on the gp-number of graphs, including the bounds on thegp-number, the value of gp-number of graph operations, and more.