竞赛图的无圈双色数：这些是冠军
Acyclic Dichromatic Number of Tournaments: these are the Champions
浏览论文内容
中文总结 AI 辅助
研究竞赛图的无圈双色数，刻画了有足够大无圈双色数的竞赛图中必出现的子竞赛图，证实相关猜想，证明其满足局部到全局性质。
中文摘要 AI 辅助
有向图的无圈双色数是顶点划分的最小规模，使得任何单个部分诱导的有向图是无圈的，并且任意两个部分之间的有向二分图也是无圈的。我们刻画了在每个具有足够大无圈双色数的竞赛图中必然出现的子竞赛图，从而证实了Bang-Jensen、Picasarri-Arrieta和Yeo的一个猜想，并证明无圈双色数满足局部到全局的性质。
英文摘要
The acyclic dichromatic number of an oriented graph is the minimum size of a vertex-partition such that the digraphs induced by any single part are acyclic, and the oriented bipartite graphs between any two parts are acyclic too. We characterize the subtournaments that must appear in every tournament with sufficiently large acyclic dichromatic number, thereby confirming a conjecture of Bang-Jensen, Picasarri-Arrieta, and Yeo and prove that acyclic dichromatic number satisfies a local to global property.
