论文标题
小尺寸的倾斜度，用于拓扑图形障碍物集
Dips at small sizes for topological graph obstruction sets
论文作者
论文摘要
罗伯逊（Robertson）和西摩（Seymour）的图表次要定理暗示了任何次要封闭图特性的有限障碍物。我们表明，只有三个障碍物的尺寸为23的障碍物，远小于22尺寸的92个，而已知数百个尺寸较大的尺寸却少了。我们描述了其他几种拓扑特性，其障碍物集在小尺寸时表现出相似的倾角。对于订单十个图，我们将35个障碍物分类为无结的嵌入和49个最大结图。
The Graph Minor Theorem of Robertson and Seymour implies a finite set of obstructions for any minor closed graph property. We show that there are only three obstructions to knotless embedding of size 23, which is far fewer than the 92 of size 22 and the hundreds known to exist at larger sizes. We describe several other topological properties whose obstruction set demonstrates a similar dip at small size. For order ten graphs, we classify the 35 obstructions to knotless embedding and the 49 maximal knotless graphs.
