arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.19385math.CO
收藏

一般位置问题:综述

The General Position Problem: A Survey

Mahatma Gandhi College(马哈特玛甘地学院);Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院);Institute of Mathematics, Physics and Mechanics(数学、力学和物理学研究所);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院);School of Mathematics and Statistics, Open University(开放大学数学与统计学院)

Ullas Chandran S. V., Sandi Klavžar, James Tuite

AI总结:

本文综述了一般位置问题,探讨了其在不同图类中的精确结果及变种问题。

摘要:

受Dudeney的国际象棋棋盘谜题启发,图论中的一般位置问题要求在一个图中找到一个最大的顶点集S,使得S中的任意三个顶点不位于同一条最短路径上。这样的最大集合中的顶点数称为图的一般位置数。本文对这个快速增长的问题进行了综述,目前已有广泛的文献。我们涵盖了各种图类的精确结果,以及一般位置数在图运算和乘积下的行为。我们还讨论了一般位置问题的不同变种,包括对应于不同图凸性的变种,以及动态、分数、着色和博弈版本的问题。

英文摘要:

Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a largest set is the \emph{general position number} of the graph. This paper provides a survey of this rapidly growing problem, which now has an extensive literature. We cover exact results for various graph classes and the behaviour of the general position number under graph products and operations. We also discuss interesting variations of the general position problem, including those corresponding to different graph convexities, as well as dynamic, fractional, colouring and game versions of the problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑