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
相关论文
共 50 条
  • [1] GENERALIZED INTRANSITIVE DICE: MIMICKING AN ARBITRARY TOURNAMENT
    Akin, Ethan
    JOURNAL OF DYNAMICS AND GAMES, 2021, 8 (01): : 1 - 20
  • [2] The (1,2)-step competition graph of a tournament
    Factor, Kim A. S.
    Merz, Sarah K.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (2-3) : 100 - 103
  • [3] Tournament immersion and cutwidth
    Chudnovsky, Maria
    Fradkin, Alexandra
    Seymour, Paul
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (01) : 93 - 101
  • [4] A remark on the tournament game
    Clemens, Dennis
    Mikalacki, Mirjana
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (03)
  • [5] Seniority bias in a tournament
    Ishida J.
    Review of Economic Design, 2006, 10 (2) : 143 - 164
  • [6] Tournament indices of inconsistency
    Szybowski, Jacek
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES 2019), 2019, 159 : 913 - 922
  • [7] Dominant tournament families
    Yuster, Raphael
    JOURNAL OF COMBINATORICS, 2021, 12 (02) : 269 - 282
  • [8] The partition of a strong tournament
    Li, H
    Shu, JL
    DISCRETE MATHEMATICS, 2005, 290 (2-3) : 211 - 220
  • [9] Adding tournament to tournament: Combining between-team and within-team incentives
    Majerczyk, Michael
    Sheremeta, Roman
    Tian, Yu
    JOURNAL OF ECONOMIC BEHAVIOR & ORGANIZATION, 2019, 166 : 1 - 11
  • [10] Graph minors and linkages
    Chen, G
    Gould, RJ
    Kawarabayashi, K
    Pfender, F
    Wei, B
    JOURNAL OF GRAPH THEORY, 2005, 49 (01) : 75 - 91