论文标题
争夺第二的图
Graphs of scramble number two
论文作者
论文摘要
图形的争夺数为高宽性提供了一个下限，并为树宽提供了上限，使其成为感兴趣的图形。在本文中，我们最多可以研究争夺数的图形，并通过有限的禁止拓扑界未成年人列表将所有此类图的分类进行分类。然后，我们证明，没有有限的禁止拓扑未成年人的有限列表来表征大于两个大于两个的固定争夺数的图形。
The scramble number of a graph provides a lower bound for gonality and an upper bound for treewidth, making it a graph invariant of interest. In this paper we study graphs of scramble number at most two, and give a classification of all such graphs with a finite list of forbidden topological minors. We then prove that there exists no finite list of forbidden topological minors to characterize graphs of any fixed scramble number greater than two.
