arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.02155math.COcs.DM
收藏

有序拉姆齐数综述

A Survey on Ordered Ramsey Numbers

Martin Balko

AI总结:

本文综述了有序拉姆齐数的最新研究进展,梳理其与组合数学其他领域的联系和著名猜想,并提出若干新的开放问题,突出有序与无序情形下行为的显著差异。

摘要:

具有线性有序顶点集的图 $G^<$ 的有序拉姆齐数是最小的正整数 $N$,使得对 $N$ 个顶点上的有序完全图的边进行任意二染色时,都包含一个按给定顺序出现的单色 $G^<$ 副本。对有序拉姆齐数定量行为的研究是拉姆齐理论中一个相对较新的主题,其中充满有趣而困难的问题。在这篇综述论文中,我们总结了有序拉姆齐数理论的最新进展。我们指出其与组合数学其他领域以及一些著名猜想的联系。我们还列出了若干新的具有挑战性的开放问题,并强调了其与无序情形相比往往截然不同的行为。

英文摘要:

The ordered Ramsey number of a graph $G^<$ with a linearly ordered vertex set is the smallest positive integer $N$ such that any two-coloring of the edges of the ordered complete graph on $N$ vertices contains a monochromatic copy of $G^<$ in the given ordering. The study of the quantitative behavior of ordered Ramsey numbers is a relatively new theme in Ramsey theory full of interesting and difficult problems. In this survey paper, we summarize recent developments in the theory of ordered Ramsey numbers. We point out connections to other areas of combinatorics and some well-known conjectures. We also list several new and challenging open problems and highlight the often strikingly different behavior from the unordered case.

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

↑