共 50 条
Tournament minors
被引:17
|作者:
Kim, Ilhee
[1
]
Seymour, Paul
[1
]
机构:
[1] Princeton Univ, Princeton, NJ 08540 USA
关键词:
Digraph;
Tournament;
Minor;
Well-quasi-order;
GRAPH MINORS;
D O I:
10.1016/j.jctb.2014.12.005
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We say a digraph G is a minor of a digraph H if G can be obtained from a subdigraph of H by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show that the class of all tournaments is a well-quasi-order under minor containment. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:138 / 153
页数:16
相关论文