邀请人：曹海涛教授
摘要： For a connected graph G=(V (G), E(G)), a set S⊆V (G) is a general position set if no three pairwise-distinct vertices from S lie on a common shortest path in G. The general position number (or gp-number for short) gp(G) of G is the cardinality of a largest general position set of G. In this talk we will survey some recent results on the gp-number of graphs, including the bounds on the gp-number, the value of gp-number of graph operations, and more.
简介：许克祥，南京航空航天大学数学系教授，博士生导师.现任美国数学会《Mathematical Reviews》评论员，中国运筹学会图论组合分会理事.2009年毕业于网赌-网赌平台推荐
，获数学博士学位，研究方向图论及其应用，先后主持完成国家自然科学基金2项,省部级科研项目4项.已在Discrete Appl. Math.、Discrete Math.、Appl. Math. Lett.、Complexity、Inter. J. Comput. Math.、J. Combin. Optim.和Linear Algebra Appl. 等刊物发表论文60余篇，出版英文专著和中文教材各1部.2018年以主持人身份获江苏省高等教育成果（高校自然科学类）三等奖1项.
