论文标题
图形上的新下限
A New Lower Bound on Graph Gonality
论文作者
论文摘要
我们定义了一个名为“争夺”号的新图形不变式。我们表明，图形的争夺数是gonity的下限，并且是树宽的上限。与树宽不同，争夺数不是次要的单调，但它是次码单调和不变的。我们计算了几个图形族的争夺数和高态性，这些图形严格大于树宽。
We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unlike the treewidth, the scramble number is not minor monotone, but it is subgraph monotone and invariant under refinement. We compute the scramble number and gonality of several families of graphs for which these invariants are strictly greater than the treewidth.
